10031
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11472
- Proper Divisor Sum (Aliquot Sum)
- 1441
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8592
- Möbius Function
- 1
- Radical
- 10031
- 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
- 47
- 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
- Numbers k such that Fib(k) == -13 (mod k).at n=35A023167
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 99.at n=20A031597
- Positive numbers having the same set of digits in base 5 and base 10.at n=39A037433
- Numbers n such that sum of digits = number of digits.at n=32A061384
- Numbers k such that phi(k) + phi(k+1) = sigma(k).at n=11A067799
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=27A075604
- a(1)=1. a(n) = a(n-1) + sum of the squares which are among the first (n-1) terms of the sequence.at n=38A101135
- Smaller of number pair whose squares are reversals of each other, with no leading zeros allowed.at n=34A106323
- Start with 1 and repeatedly reverse the digits and add 55 to get the next term.at n=22A118161
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, 0), (1, -1, -1), (1, 0, 0)}.at n=10A148506
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=14A153747
- G.f.: [Sum_{n>=0} x^(n^2) * (1+x+x^2)^n ]^2.at n=52A182153
- Irregular triangle read by rows: row n lists the rank sizes of the "electrical" poset EP_n of circular planar graphs with n boundary vertices.at n=49A232967
- a(n) = 4*a(n-4) + 6*a(n-8) + 4*a(n-12) + a(n-16) for n>15, with the sixteen initial values as shown.at n=26A238188
- Number of length n+4 0..5 arrays with no consecutive five elements summing to more than 2*5.at n=1A241933
- T(n,k)=Number of length n+4 0..k arrays with no consecutive five elements summing to more than 2*k.at n=16A241936
- Number of length 2+4 0..n arrays with no consecutive five elements summing to more than 2*n.at n=4A241938
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=0A245209
- Number of (4+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=32A250658
- Composites whose prime factorization in base 12 is an anagram of the number in base 12.at n=7A260055