5488
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 12400
- Proper Divisor Sum (Aliquot Sum)
- 6912
- 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
- 2352
- Möbius Function
- 0
- Radical
- 14
- Omega Function (Ω)
- 7
- 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
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers of form 2^i*7^j, with i, j >= 0.at n=36A003591
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=32A004006
- G.f.: 2*(1-x^3)/((1-x)^5*(1+x)^2).at n=26A005996
- Number of paraffins.at n=12A006009
- E.g.f. tanh(sin(x)*exp(x)).at n=7A009799
- Expansion of e.g.f.: sinh(exp(x)-cos(x))=x+2/2!*x^2+2/3!*x^3+12/4!*x^4+72/5!*x^5...at n=8A013315
- Triangle of coefficients in expansion of (4+7x)^n.at n=13A013625
- a(n) = n^2*(n-1)^3/4.at n=8A019584
- a(n) = floor(3rd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=11A025213
- Numbers of form 4^i*7^j, with i, j >= 0.at n=19A025619
- a(n) = 2*n^3.at n=14A033431
- a(n) = 7*n^2.at n=28A033582
- Numbers whose prime factors are 2 and 7.at n=19A033847
- Composite numbers whose prime factors contain no digits other than 2 and 7.at n=48A036312
- Triangle of numbers in which i-th row is {2^(i-j)*7^j, 0<=j<=i}; i >= 0.at n=31A036565
- 3-full (or cube-full, or cubefull) numbers: if a prime p divides n then so does p^3.at n=41A036966
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*4^j.at n=11A038270
- 13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.at n=32A051865
- Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power.at n=43A052486
- Numbers n such that n | 6^n + 4^n + 2^n.at n=48A057844