5312
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 10668
- Proper Divisor Sum (Aliquot Sum)
- 5356
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2624
- Möbius Function
- 0
- Radical
- 166
- 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
- 116
- 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
- Numbers k such that the Woodall number k*2^k - 1 is prime.at n=15A002234
- Coordination sequence T3 for Zeolite Code NON.at n=44A008214
- Coordination sequence T4 for Zeolite Code VET.at n=44A009905
- Expansion of (1-x^2-x^3)/(1-2*x-5*x^2-4*x^3-x^4).at n=7A011367
- Expansion of 1/(1-x^3-x^4-x^5-x^6).at n=31A017819
- Fibonacci sequence beginning 5, 11.at n=14A022136
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Fibonacci numbers).at n=19A024318
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (F(2), F(3), ...).at n=18A024322
- n written in fractional base 7/5.at n=23A024642
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (F(2), F(3), F(4), ...).at n=17A024885
- Expansion of (theta_3(z)*theta_3(13z)+theta_2(z)*theta_2(13z))^4.at n=37A028620
- Numbers with 14 divisors.at n=24A030632
- [ exp(1/19)*n! ].at n=6A030877
- Number of proper factorizations of p1^n*p2^3, where p1 and p2 are distinct primes.at n=15A031126
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 35.at n=28A031533
- Denominators of continued fraction convergents to sqrt(814).at n=9A042571
- Number of non-unitary divisors of n!.at n=15A048657
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=37A050775
- Numbers k such that k^16 == 1 (mod 17^3).at n=18A056088
- a(n) = A055993(n) - A034444(A056627(n)).at n=29A056630