5166
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 7938
- 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
- 1440
- Möbius Function
- 0
- Radical
- 1722
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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 partitions into non-integral powers.at n=30A000327
- a(n) = E(n+1) - 2*E(n), where E(i) is the Euler number A000111(i).at n=8A000708
- Triangle T(n,k) = P(n,k)/2, n >= 2, 1 <= k < n, of one-half of number of permutations of 1..n such that the differences have k runs with the same signs.at n=26A008970
- Powers of cube root of 13 rounded to nearest integer.at n=10A018013
- Powers of cube root of 13 rounded up.at n=10A018014
- Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.at n=17A019274
- Numbers whose base-5 representation is the juxtaposition of two identical strings.at n=40A020333
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.at n=35A024467
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).at n=19A024604
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.at n=34A025087
- Expansion of 1/((1-2x)(1-4x)(1-7x)(1-11x)).at n=3A025974
- 6 times triangular numbers: a(n) = 3*n*(n+1).at n=41A028896
- Numbers k such that 169*2^k+1 is prime.at n=16A032461
- Number of partitions of n into parts not of the form 25k, 25k+7 or 25k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=30A036006
- Starting from generation 7 add previous and next term yielding generation 8.at n=12A048454
- Sums of nonconsecutive factorial numbers.at n=32A060112
- Positions of the permutations which have the same rank in A055089 and A060118, i.e., the fixed points of permutations A060120 and A060127.at n=48A060133
- Positive numbers whose product of digits is 10 times their sum.at n=21A062043
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,15.at n=18A064244
- Numbers k such that k^6 + 1091 is prime.at n=3A066386