12556
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22792
- Proper Divisor Sum (Aliquot Sum)
- 10236
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 6278
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Arrange digits of cubes in ascending order.at n=25A032553
- Base-7 palindromes that start with 5.at n=27A043019
- Numbers m such that 2*phi(m) = phi(m+1).at n=17A050472
- Number of fixed polyominoes with n cells of which no four are equally spaced on a straight line.at n=12A065068
- Floor (e^(n / log(n))).at n=31A096181
- Number of B-trees of order infinity with n leaves, where a(n) = Sum_{k=1..floor(n/2)} a(k)*C(n-k-1,n-2*k) for n >= 2, with a(0)=0, a(1)=1.at n=19A119262
- Number of (n+5) X 8 0..1 matrices with each 6 X 6 subblock idempotent.at n=8A224572
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=6A232886
- Number of (1+1)X(n+1) 0..3 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i*x(i,j), i=1..1+1} nondecreasing.at n=3A232887
- a(n) = n + floor( n^2/2 + n^3/3 ).at n=33A236773
- Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to 3 6 or 9.at n=3A251293
- Number of (n+1)X(4+1) 0..3 arrays with every 2X2 subblock summing to 3 6 or 9.at n=0A251296
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 3 6 or 9.at n=6A251300
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 3 6 or 9.at n=9A251300
- Number of (n+1) X (3+1) 0..1 arrays with every 2 X 2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.at n=40A253392
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 181", based on the 5-celled von Neumann neighborhood.at n=25A270628
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 390", based on the 5-celled von Neumann neighborhood.at n=42A271600
- Numerator of sigma_3(n)/sigma_2(n).at n=27A298754
- Expansion of e.g.f. Product_{i>=1, j>=1} (1 + x^(i*j))^(1/(i*j)).at n=7A318696
- Numbers k such that 405*2^k+1 is prime.at n=25A323102