12153
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16208
- Proper Divisor Sum (Aliquot Sum)
- 4055
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8100
- Möbius Function
- 1
- Radical
- 12153
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 156
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Divisors of 2^50 - 1.at n=19A003554
- a(1) = 3, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).at n=5A063269
- Numbers n such that both n^4 + 2 and n^4 - 2 are prime.at n=43A071351
- a(n) = sum of the first n upper twin primes.at n=34A086168
- a(n) = 3*(2*n^2 + 1).at n=45A097803
- Stable Poincaré series [or Poincare series] for Lie algebra of type A (i.e., the variety of complex k X k matrices with distinct eigenvalues).at n=21A098787
- a(n) = least k such that the remainder when 23^k is divided by k is n.at n=13A128363
- a(n) = 392*n + 1.at n=31A158002
- a(n) = 62*n^2 + 1.at n=14A158676
- G.f. satisfies: A(x) = 1/Product_{n>=1} (1 - 3*x^n*A(x^n)).at n=5A205773
- a(n) + a(n+2) = n^3.at n=29A206481
- Total sum of parts of multiplicity 8 in all partitions of n.at n=39A222736
- Number of partitions p of n such that (sum of parts with multiplicity 1) > (sum of all other parts).at n=38A240451
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 139", based on the 5-celled von Neumann neighborhood.at n=6A270279
- Number of edges in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts.at n=45A357008
- Numbers k such that A361338(k) = 8.at n=43A361347
- a(n) is equal to the number of black 1 X 1 X 1 cubes in a certain coloring of the n X n X n cube (see comments for precise definition).at n=28A365486
- Squarefree semiprimes k such that k+1 is the product of three distinct primes and k+2 is the product of four distinct primes.at n=7A376352