Properties of the Number 15152

Fifteen Thousand One Hundred Fifty-Two

Basics

Value: 15151 → 15152 → 15153

Parity: even

Prime: No

Previous Prime: 15149

Next Prime: 15161

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 947

Divisors: 1, 2, 4, 8, 16, 947, 1894, 3788, 7576, 15152

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11101100110000

Octal: 35460

Duodecimal: 8928

Hexadecimal: 3b30

Square: 229583104

Square Root: 123.09346042743294

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

Triangle read by rows: Coefficients of the polynomials S2(n, x) * EZ(n, x), where S2 denote the Stirling set polynomials and EZ the Eulerian zig-zag polynomials A205497. A373428

Concatenate n-th prime and n-th composite. A38530

a(n) = (((6ⁿ mod 5ⁿ) mod 4ⁿ) mod 3ⁿ) mod 2ⁿ. A64855

Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right. A297627

Solution to the non-squashing boxes problem (version 2). A89055

a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number). A23487

a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number). A23493

Ramanujan numbers (A000594) read mod 16384. A126824

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

Partial sums of A033616. A299902