4466
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 4174
- 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
- 1680
- Möbius Function
- 1
- Radical
- 4466
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 139
- 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
- yes
- Odd
- no
Appears in sequences
- Nearest integer to 24*(2^n - 1)/n.at n=10A003138
- Integer part of 24(2^n-1)/n.at n=10A003176
- a(n) = (n-1)*n*(n+4)/6.at n=29A005581
- Number of binary rooted trees of height n requiring 3 registers.at n=4A006223
- Evolutionary trees of magnitude n.at n=5A007152
- Coordination sequence T1 for Zeolite Code AFO.at n=44A008015
- Coordination sequence T4 for Zeolite Code MOR.at n=43A008185
- a(0) = 1, a(n) = 31*n^2 + 2 for n>0.at n=12A010020
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2*n+3)*(2*n-1).at n=15A030440
- a(n) = (3*n+1)*(4*n+1).at n=19A033577
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 5).at n=52A035573
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) <= cn(2,5) = cn(4,5).at n=69A036872
- a(n)=(s(n)+3)/9, where s(n)=n-th base 9 palindrome that starts with 6.at n=30A043077
- Number of chiral chord diagrams on n nodes.at n=6A054938
- Inverse Euler transform of A000016.at n=18A057772
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=19A058229
- Multiples of 7 containing only even digits.at n=45A061826
- Multiples of 11 having only even digits.at n=43A061832
- a(n) = (9n^2 + 9n + 4)/2.at n=31A062123
- a(n) = min(x : x^2 + n^2 = 0 mod (x+n-1)).at n=47A066333