12931
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13192
- Proper Divisor Sum (Aliquot Sum)
- 261
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12672
- Möbius Function
- 1
- Radical
- 12931
- 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
- 24
- 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
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 3,1,2,0.at n=4A037783
- Number of anisohedral polyhexes with n cells.at n=18A075215
- Numbers k such that the digits of sigma(k) are a permutation of those of k, in base 10.at n=19A115920
- Expansion of Product_{k > 0} (1 + f(k)*x^k), where f(k) = A147952(A004001(k)).at n=36A147982
- Odd numbers producing 20 even numbers in the Collatz iteration.at n=41A199818
- Triangle read by rows: T(n,k) = n^4 + (n*k)^2 + k^4, 1 <= k <= n.at n=42A219069
- Number of length n words on alphabet {0,1} such that the length of every maximal block of 0's (runs) is the same.at n=19A243815
- Number of length n+4 0..6 arrays with some pair in every consecutive five terms totalling exactly 6.at n=0A246890
- T(n,k)=Number of length n+4 0..k arrays with some pair in every consecutive five terms totalling exactly k.at n=15A246892
- Number of length 1+4 0..n arrays with some pair in every consecutive five terms totalling exactly n.at n=5A246893
- Integers k for which A000594(k)^2 > 4 k^11, where A000594 is Ramanujan's tau function.at n=28A364087
- Non-palindromic numbers m such that m * repunit of length k is palindromic for all large enough k.at n=53A370053