5296
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 10292
- Proper Divisor Sum (Aliquot Sum)
- 4996
- 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
- 2640
- Möbius Function
- 0
- Radical
- 662
- Omega Function (Ω)
- 5
- 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
- 28
- 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
- a(n) = Sum_{k=0..n-1} Bell(k), where the Bell numbers Bell(k) are given in A000110.at n=9A005001
- Column of Kempner tableau.at n=7A005438
- Number of down-up permutations of n+6 starting with n+1.at n=4A006215
- Number of down-up permutations of n+5 starting with 5.at n=5A006217
- Coordination sequence T1 for Zeolite Code MOR.at n=47A008182
- Coordination sequence T2 for Zeolite Code TON.at n=45A008242
- Boustrophedon version of triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=49A008280
- Triangle of Euler-Bernoulli or Entringer numbers read by rows.at n=49A008281
- Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1.at n=39A008282
- Read across rows of Euler-Bernoulli or Entringer triangle.at n=24A008283
- Coordination sequence for FeS2-Marcasite, Fe position.at n=38A009955
- Triangle of Euler-Bernoulli or Entringer numbers.at n=41A010094
- Expansion of e.g.f.: exp(2*x)/(1-x).at n=6A010842
- Pisot sequence E(10,22), a(n) = floor( a(n-1)^2/a(n-2)+1/2 ).at n=8A014008
- Numbers k such that the continued fraction for sqrt(k) has period 60.at n=19A020399
- Number of partitions of n with equal number of parts congruent to each of 2 and 4 (mod 5).at n=39A035560
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=47A036816
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(2,5) <= cn(3,5) = cn(4,5).at n=71A036850
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(2,5) < cn(3,5) = cn(4,5).at n=71A036853
- Base-6 palindromes that start with 4.at n=17A043013