12471
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
- 16632
- Proper Divisor Sum (Aliquot Sum)
- 4161
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8312
- Möbius Function
- 1
- Radical
- 12471
- 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
- 187
- 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
- a(n) = Sum_{k=1..n} k*phi(k).at n=38A011755
- Numerators of continued fraction convergents to sqrt(807).at n=6A042556
- Numbers n > 13 such that x^n + x^13 + x^12 + x^11 + x^10 + x^9 + x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=38A057489
- Number of Pythagorean triples with hypotenuse <= 10^n.at n=3A101930
- Number of complete partitions of n.at n=36A126796
- Numbers which are palindromic in their Elias delta code representation.at n=33A281380
- Unrooted unlabeled connected Ptolemaic graphs on n nodes.at n=9A287888
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 2, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=37A294870
- Number of free pure symmetric multifunctions with leaves a multiset whose multiplicities are the integer partition with Heinz number n.at n=39A317655
- Numbers k such that 479*2^k+1 is prime.at n=19A319488
- Numbers k such that k, k + 1 and k + 2 are all norm-deficient in Gaussian integers (A332572).at n=39A332574
- Numbers m such that 20*m + 1, 80*m + 1, 100*m + 1, and 200*m + 1 are all primes.at n=18A372186