5517
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
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7982
- Proper Divisor Sum (Aliquot Sum)
- 2465
- 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
- 3672
- Möbius Function
- 0
- Radical
- 1839
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T2 for Zeolite Code MEP.at n=44A008158
- Pseudoprimes to base 35.at n=21A020163
- Numbers k such that the continued fraction for sqrt(k) has period 58.at n=40A020397
- Numbers k such that Fib(k) == -34 (mod k).at n=34A023169
- Super-5 Numbers (5 * n^5 contains substring '55555' in its decimal expansion).at n=1A032745
- Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5).at n=11A036887
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=41A050037
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=45A050057
- T(n,n-3), array T as in A054106.at n=31A054107
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=18A055755
- Numbers n such that A003313(n) = A003313(2n).at n=16A086878
- Numbers n such that (n + prime(n)), (n+1 + prime(n+1)) and (n+2 + prime(n+2)) are divisible by 5.at n=35A107581
- Number of ordered quadruples (i,j,k,l) in range [0..n] satisfying i == j (mod 2), j == k (mod 3) and k == l (mod 4).at n=18A115523
- a(1) = 335; a(n) is the smallest k > a(n-1) such that k*A002110(n)^30 - 1 is prime.at n=29A119760
- Row sums of triangle A143102.at n=24A143103
- First appearance of n in continued fraction for sqrt(2)+sqrt(3).at n=54A147584
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 0, 1), (0, 0, 1), (1, 1, -1)}.at n=9A148374
- Number of nondecreasing integer sequences of length 15 with sum zero and sum of absolute values 2n.at n=11A158149
- a(n) = smallest number m such that m^2 and n^2 share no common digits and m^2 and n^2 together use all 10 digits, a(n) = 0 if no such m exists.at n=33A158931
- Coefficients in the expansion of C/B^2, in Watson's notation of page 118.at n=16A160525