12625
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15912
- Proper Divisor Sum (Aliquot Sum)
- 3287
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10000
- Möbius Function
- 0
- Radical
- 505
- Omega Function (Ω)
- 4
- 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
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 k | 4^k + 1.at n=11A015950
- Numbers k such that k | 9^k + 1.at n=11A015957
- Numbers k that divide 4^k + 1, k not a power of 5.at n=5A015974
- Number of partitions of n in which the least part is 3.at n=56A026796
- Quotient of 'base-2' division described in A032533.at n=12A032534
- Numbers k that divide 8^k + 2^k.at n=29A045581
- a(n) = gcd(2^n + 1, 3^n + 1).at n=49A066803
- Numbers n such that phi(2n+1) = sigma(n).at n=34A067229
- 1/n has period 4 in base 10.at n=41A069858
- Numerator of Sum_{k=0..n} binomial(n,k)/2^(k*(k-1)/2).at n=5A079491
- Numbers n such that 2*(10^n-1)/3+(10^(n-1)+1) or (69*10^(n-1)+3)/9 is a plateau or depression prime.at n=8A082714
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=23A097225
- Number of lines through at least 2 points of a 6 X n grid of points.at n=39A160846
- Number of partitions of 3n + 2 into parts >= 3.at n=17A182808
- a(n) = gcd(k^n + 1, (k+1)^n + 1) for the smallest k at which the GCD exceeds 1.at n=48A186710
- Q-residue of the triangle p(n,k)=floor((n+1)/(n+k+2)/2), 0<=k<=n, where Q is the triangular array (t(i,j)) given by t(i,j)=1. (See Comments.)at n=8A193654
- Number of nX3 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=3A208348
- Number of n X 4 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=2A208349
- T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=17A208353
- T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=18A208353