4807
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 953
- 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
- 3960
- Möbius Function
- -1
- Radical
- 4807
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 121
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = floor(1000*log_2(n)).at n=27A004265
- a(n) = round(1000*log_2(n)).at n=27A004266
- Numerator of 2^n*(3*n-3)!/( ((n-1)!)^3 * (2*n)! ).at n=8A004677
- Coordination sequence T2 for Zeolite Code VET.at n=42A009903
- Coordination sequence T4 for Zeolite Code VET.at n=42A009905
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=31A010001
- Pseudoprimes to base 45.at n=31A020173
- Quasi-Carmichael numbers to base 10: squarefree composites n such that (n,2*3*5*7) = 1 and prime p|n ==> p-10|n-10.at n=0A029553
- Quasi-Carmichael numbers to base 7: squarefree composites n such that (n,2*3*5) = 1 and prime p|n ==> p-7|n-7.at n=2A029556
- For n>0, a(n) is the least quasi-Carmichael number to base n; a(0) = least composite squarefree integer.at n=10A029590
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).at n=43A035546
- Number of partitions of n into parts not of the form 25k, 25k+6 or 25k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=30A036005
- Number of ordered rooted trees with n non-root nodes and all outdegrees <= six.at n=9A036768
- Numbers whose base-7 representation contains exactly three 0's.at n=34A043395
- Numbers n such that 259*2^n-1 is prime.at n=14A050888
- Numbers n such that x^n + x^12 + 1 is irreducible over GF(2).at n=11A057482
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=7A070193
- Sorted A079341.at n=58A078490
- a(n) = floor(C(n+8,8)/C(n+2,2)).at n=16A084631
- Nonprimes k that divide (Fibonacci(k^2)-1).at n=37A086504