5875
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 1613
- 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
- 4600
- Möbius Function
- 0
- Radical
- 235
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- Coordination sequence T4 for Zeolite Code FER.at n=47A008109
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=17A020445
- Schoenheim bound L_1(n,n-4,n-5).at n=24A036830
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.at n=34A057289
- a(n) = (2*n - 1)*(3*n^2 - 3*n + 2)/2.at n=12A063491
- Expansion of (1 + x)*(1 - x + x^2)/((1 - x)^4*(1 + x + x^2)).at n=36A070333
- Average of four successive primes squared, (prime(n)^2 + prime(n+1)^2 + prime(n+2)^2 + prime(n+3)^2)/4, n>=2.at n=18A075894
- Second binomial transform of F(n+1).at n=7A081567
- Square array of binomial transforms of Fibonacci numbers, read by ascending antidiagonals.at n=52A081572
- Hypotenuses for which there exist exactly 3 distinct integer triangles.at n=32A084647
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both semiprime.at n=12A085774
- Smallest number which requires n iterations to reach 1 in the juggler sequence problem.at n=30A094670
- Let M = the 2 X 2 matrix [ 0 3 / 3 2]. Take (M^n * [1 1])/3 = [p q]; then a(n) = p.at n=6A094726
- Expansion of ((1+x)^4-(1+x)x^3)/((1+x)^5-x^5).at n=15A105370
- Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.at n=31A117395
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=81A117807
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=87A119455
- a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/4).at n=36A120161
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+833)^2 = y^2.at n=22A129010
- a(n) = n*(n^2 + 3*n + 5)/3.at n=25A145069