14880
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 48384
- Proper Divisor Sum (Aliquot Sum)
- 33504
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 930
- Omega Function (Ω)
- 8
- 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
- 40
- 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
- Number of compositions of n into 5 ordered relatively prime parts.at n=22A000743
- Orders of noncyclic simple groups (without repetition).at n=17A001034
- Index of (the image of) the modular group Gamma(n) in PSL_2(Z).at n=30A001766
- a(n) = n*(31*n-1)/2.at n=31A022288
- a(n) = T(n,n-3), where T is the array in A026386.at n=29A026394
- a(n) = n*(n+1)*(n+2)/2.at n=30A027480
- Solutions x of 2*uphi(x)=x, where uphi is the unitary phi function (A047994).at n=4A030163
- a(n) = lcm(n,n+1,n+2).at n=29A033931
- Least k for which the integers Floor(k/(m*(m+1))) for m=1,2,...,n are distinct.at n=34A054061
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives r numbers.at n=12A080766
- a(0) = 1, a(n) = 480*sigma(n).at n=16A083728
- a(0) = 1, a(n) = 480*sigma(n).at n=25A083728
- Numbers n such that primitive solutions for 1/n^2 = 1/x^2 + 1/y^2 exist.at n=36A094807
- Number of edges in LCM of graphs K_n and C_4.at n=30A098585
- Orders of non-cyclic simple groups (with repetition).at n=17A109379
- G.f.: square root of weight enumerator of [32,6,16] Reed-Muller code RM(1,5).at n=3A110824
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=26A116037
- a(1) = 6; for n>1, a(n) = prime(n)*(prime(n)^2 - 1)/2.at n=10A117762
- Numbers such that 2*UnitaryPhi(2*UnitaryPhi(n)) = n.at n=16A120453
- Half of product of three numbers: n-th prime, previous and following number.at n=10A127918