4990
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9000
- Proper Divisor Sum (Aliquot Sum)
- 4010
- 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
- 1992
- Möbius Function
- -1
- Radical
- 4990
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 72
- 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
- Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).at n=30A003600
- Coordination sequence T1 for Zeolite Code DAC.at n=44A008067
- Coordination sequence T3 for Zeolite Code SGT.at n=44A008231
- Coordination sequence T1 for Zeolite Code VNI.at n=43A009907
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=16A015988
- a(n) = n*(25*n - 1)/2.at n=20A022282
- Fibonacci sequence beginning 2, 12.at n=14A022368
- a(1) = 3; a(n+1) = a(n)-th composite.at n=27A022451
- Expansion of Product_{m>=1} (1+q^m)^30.at n=3A022594
- T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=33A050161
- T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157.at n=25A050164
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=11A065213
- Interprimes which are of the form s*prime, s=10.at n=15A075285
- Number of planar partitions of n with exactly 5 rows.at n=13A091359
- Equatorial structured meta-anti-diamond numbers, the n-th number from an equatorial structured n-gonal anti-diamond number sequence.at n=9A100189
- A004001[n + 1]*Fibonacci[n + 1] - 2*A004001[n]*Fibonacci[n] + A004001[n - 1]*Fibonacci[n - 1].at n=16A120472
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 4 and 9.at n=48A136821
- Tribonacci-like sequence; a(0)=2, a(1)=1, a(2)=1, a(n) = a(n-1) + a(n-2) + a(n-3).at n=15A141036
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(2^(m-1) + 2*m-2 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=50A146956
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(2^(m-1) + 2*m-2 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=49A146956