12147
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16200
- Proper Divisor Sum (Aliquot Sum)
- 4053
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8096
- Möbius Function
- 1
- Radical
- 12147
- 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
- 63
- 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
- Powers of cube root of 13 rounded to nearest integer.at n=11A018013
- Powers of cube root of 13 rounded up.at n=11A018014
- A Langford-like sequence.at n=38A108401
- a(n) = least k such that the remainder when 23^k is divided by k is n.at n=19A128363
- Number of idempotent 3 X 3 0..n matrices of rank 2.at n=43A224334
- Positions of incrementally largest terms in the continued fraction of Soldner's constant.at n=13A229230
- Expansion of Product_{k>=1} (1 + 2*x^k)/(1 - x^k).at n=17A264686
- a(n) = A289671(n)/2^f(n), where f(n) = 2*floor((n-1)/3) + ((n+2) mod 3) = A004523(n).at n=40A289677
- a(n) = A289677(3*n+2).at n=13A290440
- Indices of primes followed by a gap (distance to next larger prime) of 38.at n=30A320717
- Number of maximal product-free subsets of {1..n}.at n=45A326496
- Total number of parts which are powers of 2 in all partitions of n.at n=25A342230
- Number of integer partitions of n with some part that can be written as a nonnegative linear combination of the other distinct parts.at n=34A365068