4792
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9000
- Proper Divisor Sum (Aliquot Sum)
- 4208
- 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
- 2392
- Möbius Function
- 0
- Radical
- 1198
- 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
- 121
- 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
- yes
- Odd
- no
Appears in sequences
- Number of rooted identity matched trees with n nodes.at n=7A005753
- Shifts left when inverse Moebius transform applied twice.at n=37A007557
- Coordination sequence T1 for Zeolite Code MFS.at n=43A008173
- Coordination sequence T2 for Zeolite Code MFS.at n=43A008174
- Powers of cube root of 24 rounded down.at n=8A018045
- Numbers k such that the continued fraction for sqrt(k) has period 44.at n=41A020383
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 3).at n=40A035535
- Positive numbers having the same set of digits in base 7 and base 9.at n=28A037439
- Coordination sequence T6 for Zeolite Code STT.at n=46A038421
- a(n) = Sum_{i=0..floor((n+1)/2)} T(2i+1,n-2i-1) where T is A049615.at n=50A049619
- A simple grammar: partial sums of A008965.at n=16A052825
- a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.at n=10A056744
- a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.at n=11A056744
- Number of squared primes <= 2^n.at n=31A060967
- Number of fourth powers of primes <= 2^n.at n=62A060970
- Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n.at n=12A091461
- Number of partitions of n^2 into squares greater than 1.at n=17A092362
- a(n) is the smallest number x such that the number of prime powers (including primes, excluding 1), in the neighborhood of x with radius ceiling(log(x)), equals n.at n=6A096510
- Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of x with Ceiling[Log[x]] radius equals 6.at n=0A096517
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k low humps. (A hump is an upstep followed by 0 or more flatsteps followed by a downstep. A low hump is a hump that starts at level zero.).at n=43A097887