4625
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5928
- Proper Divisor Sum (Aliquot Sum)
- 1303
- 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
- 3600
- Möbius Function
- 0
- Radical
- 185
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 33
- 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 trees of diameter 7.at n=8A000550
- Another approximation to A000084(n).at n=9A001573
- a(n) = 1 + n/2 + 9*n^2/2.at n=32A006137
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=44A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=44A007707
- Coordination sequence T3 for Zeolite Code EUO.at n=42A008098
- Numbers k such that k^2 and k have same last 3 digits.at n=19A008853
- Number of Barlow packings that repeat after exactly n layers.at n=19A011768
- Consider pairs (k,m) such that k^2 begins with a 1 and when the 1 is changed to a 2 we again get a square, m^2; sequence gives values of m for primitive solutions.at n=1A018232
- Coordination sequence T2 for Zeolite Code CZP.at n=44A019457
- Strong pseudoprimes to base 68.at n=16A020294
- a(n) = least m such that if r and s in {1/4, 1/8, 1/12,..., 1/4n} satisfy r < s, then r < k/m < s for some integer k.at n=38A024825
- a(n) = floor(2nd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=29A025212
- Numbers that are the sum of 2 nonzero squares in exactly 4 ways.at n=19A025287
- Numbers that are the sum of 2 nonzero squares in 4 or more ways.at n=19A025295
- Numbers that are the sum of 2 distinct nonzero squares in exactly 4 ways.at n=19A025305
- Numbers that are the sum of 2 distinct nonzero squares in 4 or more ways.at n=19A025314
- a(n) = (d(n)-r(n))/5, where d = A026040 and r is the periodic sequence with fundamental period (4,0,4,3,4).at n=38A026042
- a(n) = (d(n)-r(n))/5, where d = A026054 and r is the periodic sequence with fundamental period (3,3,0,0,4).at n=46A026056
- Number of distinct products ijk with 0 <= i,j,k <= n.at n=42A027426