8625
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 6351
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4400
- Möbius Function
- 0
- Radical
- 345
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 52
- 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
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals up to rotation.at n=44A003451
- Numbers k such that k^2 and k have same last 3 digits.at n=35A008853
- Convolution of odd numbers and A000201.at n=24A023658
- Odd 9-gonal (or enneagonal) numbers.at n=25A028991
- a(n) = (2*n - 1)*(3*n + 1).at n=38A033569
- n! has a palindromic prime number of digits.at n=20A035067
- Composite n such that (n-1)*phi(n) is a perfect square.at n=18A069953
- Smallest integer >= 0 of the form x^4 - n^3.at n=30A070928
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=22A076425
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=32A081378
- Difference between A007678(2n)/(2n) and (n-1)^2.at n=31A085611
- Numbers n such that n is not the power of a prime and such that for every prime divisor p of n, p-1 divides n-1.at n=29A087442
- Triangle read by rows, related to Pascal's triangle, starting with rows 1; 1,1.at n=61A091533
- Triangle read by rows, related to Pascal's triangle, starting with rows 1; 1,1.at n=59A091533
- Numbers k such that numerator of Sum_{i=1..k} 1/(prime(i)-1) is prime.at n=56A092063
- a(n) = n*(n+2)*(2*n-1)/3. Also, row sums of triangle A131422.at n=22A131423
- Partial sum of centered tetrahedral numbers A005894.at n=14A132366
- Numbers n such that primorial(n)/2 - 64 is prime.at n=27A139448
- a(n) = (n^3 + 18*n^2 + 17*n + 6)/6.at n=32A143058
- Duplicate of A131423.at n=22A143371