Properties of the Number 28149

Twenty-Eight Thousand One Hundred Forty-Nine

Basics

Value: 28148 → 28149 → 28150

Parity: odd

Prime: No

Previous Prime: 28123

Next Prime: 28151

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 853

Divisors: 1, 3, 11, 33, 853, 2559, 9383, 28149

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110111110101

Octal: 66765

Duodecimal: 14359

Hexadecimal: 6df5

Square: 792366201

Square Root: 167.77663722938306

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

a(1) = 1; for n > 1, a(n) = 4·a(A252463(n)) + (n mod 4). A292384

a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists. A360215

Smallest k such that n⁸+k⁸, n⁴+k⁴, n²+k², n+k are simultaneously prime. A71564

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood. A273121

The five digits of a(n) and their four successive absolute first differences are all distinct. A365257

Numbers whose base-5 representation contains exactly three 0's and three 4's. A45217

a(1) = 1; for n > 1, a(n) is the least positive integer not already in the sequence such that a(n) == a(n-1) (mod prime(n-1)). A364054

Expansion of 1/((1-4x)(1-7x)(1-9x)(1-10x)). A28149