4790
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 3850
- 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
- 1912
- Möbius Function
- -1
- Radical
- 4790
- 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
- 33
- 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
- Shifts left when inverse Moebius transform applied twice.at n=36A007557
- Coordination sequence T2 for Zeolite Code MEP.at n=41A008158
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 2 (most significant digit on left).at n=27A029447
- n! has a palindromic prime number of digits.at n=18A035067
- Number of partitions satisfying (cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=39A036803
- Positive numbers having the same set of digits in base 7 and base 9.at n=26A037439
- Partial sums of A045954.at n=46A045964
- a(n) = Sum_{k=1..n} phi(k)^2.at n=30A057434
- Numbers k such that k^(k+1) + (k+1)^k is prime.at n=7A073499
- a(n) = -1/16-3*n^2/8+17*n/12+n^3/12+(-1)^n/16.at n=39A088795
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=43A094658
- a(n) = 3*Fibonacci(n) + (-1)^n.at n=17A097133
- Number of polyominoes consisting of 5 regular unit n-gons.at n=32A103471
- Partial sums of A040976 (= primes-2).at n=48A103976
- a(n) = A108466(A025487).at n=26A108467
- Eigenvector of the triangle of distinct partitions (A008289), so that: a(n) = Sum_{k=1..tri(n)} A008289(n,k)*a(k) for n>=1 with a(1)=1, where tri(n) = floor((sqrt(8*n+1)-1)/2).at n=41A118399
- Coefficients of x^n in the n-th iteration of x*(1+x)^2 for n>=1.at n=4A119820
- a(1)=7; a(n)=floor((35+sum(a(1) to a(n-1)))/5).at n=36A120175
- Numbers that are the sum of exactly 3 sets of Fibonacci numbers.at n=51A122195
- Record values in A132601.at n=39A132603