12431
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12864
- Proper Divisor Sum (Aliquot Sum)
- 433
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12000
- Möbius Function
- 1
- Radical
- 12431
- 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
- yes
- 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
- Centered icosahedral (or cuboctahedral) numbers, also crystal ball sequence for f.c.c. lattice.at n=15A005902
- Initial pile sizes which guarantee a win for player 2 in a certain variant of Nim.at n=42A016741
- Pseudoprimes to base 39.at n=27A020167
- Strong pseudoprimes to base 29.at n=12A020255
- Strong pseudoprimes to base 39.at n=11A020265
- Numbers k such that A055079(k) = 2^k.at n=28A057838
- a(n) = n^4 + 2*n^3 + 4*n^2 + 3*n + 1 = ((n+1)^5+n^5) / (2*n+1).at n=10A072025
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=35A075421
- Sum of first n 5-almost primes.at n=39A086047
- a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.at n=35A087863
- a(n) = smallest k such that the base 4 Reverse and Add! trajectory of A075421(n) joins the trajectory of k.at n=35A091676
- Number of squares in an n X n grid of squares with diagonals.at n=22A111500
- Numbers of the form k^2 - k - 1 whose digit sum is also a number of the form k^2 - k - 1.at n=39A117746
- Number of distinct values taken by 6^6^...^6 (with n 6's and parentheses inserted in all possible ways).at n=12A145546
- Numbers k such that the fractional part of (3/2)^k is less than 1/k.at n=9A153662
- Number of binary strings of length n with no substrings equal to 0001 0011 or 1110.at n=16A164461
- Smallest number m such that exactly n odd numbers can be seen as proper subsequences of m in decimal representation.at n=23A164766
- Number of -5..5 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=11A200178
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| = 2*|x-y| - |y-z|.at n=31A212578
- Number of partitions of n such that (number of distinct parts) = number of 1s.at n=50A239960