4830
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 13824
- Proper Divisor Sum (Aliquot Sum)
- 8994
- 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
- 1056
- Möbius Function
- -1
- Radical
- 4830
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 121
- 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
- Ramanujan's tau function (or Ramanujan numbers, or tau numbers).at n=4A000594
- Number of compositions of n into 5 ordered relatively prime parts.at n=16A000743
- Triangulations of the disk G_{n,2}.at n=5A002711
- a(n) = 2*n*(2*n-1).at n=35A002939
- Numbers that are the sum of 7 positive 6th powers.at n=42A003363
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=15A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=15A004967
- Number of n-step mappings with 4 inputs.at n=12A005945
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=34A013592
- Numbers whose sum of divisors is a cube.at n=27A020477
- a(n) is least k such that k and 7k are anagrams in base n (written in base 10).at n=28A023099
- a(n) = (-1 + prime(n+1)^2)/4.at n=32A024701
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=35A024932
- Number of n-move king paths on 8x8 board from given corner to same corner.at n=7A025596
- a(n) = (d(n)-r(n))/2, where d = A026054 and r is the periodic sequence with fundamental period (1,0,0,0).at n=33A026055
- a(n) = T(2*n, n-2), where T is given by A026584.at n=6A026592
- Second diagonal of A027446.at n=10A027449
- Every run of digits of n in base 13 has length 2.at n=30A033011
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+7 or 16k-7.at n=46A036023
- Sparsely totient numbers; numbers n such that m > n implies phi(m) > phi(n).at n=37A036913