Properties of the Number 12152

Twelve Thousand One Hundred Fifty-Two

Basics

Value: 12151 → 12152 → 12153

Parity: even

Prime: No

Previous Prime: 12149

Next Prime: 12157

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 7 ² × 31

Divisors: 1, 2, 4, 7, 8, 14, 28, 31, 49, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111101111000

Octal: 27570

Duodecimal: 7048

Hexadecimal: 2f78

Square: 147671104

Square Root: 110.23611023616536

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(n) = 6·n² + 2 for n > 0, a(0)=1. A5897

T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents. A200785

T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 10 (10 maximizes T(1,1)). A234083

Sum of all the parts in the partitions of n into 8 parts. A308989

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35 (35 maximizes T(1,1)). A233903

The number of partitions of n in which at least one part is a multiple of 3. A295341

Numbers k for which A335915(k) = A335915(σ(k)). A336461

Numbers m such that the GCD of the x's that satisfy σ(x) = m is 3. A241648

The smallest position with nim-value n in subtract-a-square game. A297963

Sum of divisors of the n-th second hexagonal number. A346866