4780
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
- 12
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 5300
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1904
- Möbius Function
- 0
- Radical
- 2390
- Omega Function (Ω)
- 4
- 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
- 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
- Expansion of e.g.f. sin(x)/cos(log(1+x)).at n=7A009552
- Number of different products of partitions of n; number of partitions of n into prime parts (1 included); number of distinct orders of Abelian subgroups of symmetric group S_n.at n=45A034891
- Coordination sequence T1 for Zeolite Code ESV.at n=46A038409
- Numerators of continued fraction convergents to sqrt(166).at n=8A041306
- Denominators of continued fraction convergents to sqrt(946).at n=8A042831
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=13A052049
- Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=34A053199
- Triangular array T: put T(n,0)=n for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.at n=42A054144
- 3*Fibonacci(n) - 11.at n=12A054968
- a(n+1) = a(n) converted to base 10 from base 12.at n=25A055983
- Number of partitions of n into parts all relatively prime to n.at n=34A057562
- McKay-Thompson series of class 26A for Monster.at n=25A058596
- McKay-Thompson series of class 35B for Monster.at n=35A058641
- Numbers which are the sum of their proper divisors containing the digit 9.at n=10A059468
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).at n=1A072494
- Indices of double-safe primes: p=prime(n) is double-safe: q=(p-1)/2 & r=(q-1)/2 are both prime (and q is safe).at n=46A075133
- a(n) = (7*2^n - 4(-1)^n)/3.at n=11A083595
- Indices of primes in the sequence defined by A(0) = 47, A(n) = 10*A(n-1) - 33 for n > 0.at n=21A101724
- Positive integers n such that n^14 + 1 is semiprime (A001358).at n=25A104335
- Numbers k such that A003313(k) = A003313(3*k).at n=28A116459