5489
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6000
- Proper Divisor Sum (Aliquot Sum)
- 511
- 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
- 4980
- Möbius Function
- 1
- Radical
- 5489
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 129
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=32A000125
- Expansion of x/(1 - 8*x - 7*x^2).at n=5A015576
- First nontrivial or multidigital Armstrong number to base n.at n=33A016087
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=10A020417
- Expansion of 1/((1-2x)(1-6x)(1-7x)(1-10x)).at n=3A026391
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=24A028948
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=19A031804
- a(n) = 2*n^3 + 1.at n=14A033562
- First gap of n in sequence A038593 (lower terms).at n=38A038661
- Numbers ending with '9' that are the difference of two positive cubes.at n=23A038864
- a(1) = 5; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=39A046255
- a(n)=T(n,n+3), array T as in A049735.at n=28A049743
- Birthday set of order 9: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7, 8 and 9.at n=34A057541
- Numbers k such that 2*5^k - 3 is prime.at n=17A057915
- The a(n)-th highly-composite number (A002182) is the first one divisible by 2^n.at n=14A072847
- a(n) = n^3 - n^2 - n - 1.at n=18A083074
- Expansion of e.g.f.: exp(x)/(1-x^2/2).at n=8A087214
- G.f.: A(x) = Product_{n>=1} 1/(1 - n*A007947(n)*x^n)^(1/n^2), where A007947(n) is the product of the distinct prime factors of n.at n=15A095895
- Bisection of A000125.at n=16A100503
- a(2*n+1) = 7*a(n), a(2*n+2) = 8*a(n) + a(n-1).at n=30A116554