5608
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10530
- Proper Divisor Sum (Aliquot Sum)
- 4922
- 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
- 2800
- Möbius Function
- 0
- Radical
- 1402
- Omega Function (Ω)
- 4
- 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
- 85
- 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
- Coordination sequence T6 for Zeolite Code MTT.at n=46A008194
- a(n) = floor(binomial(n,5)/6).at n=23A011843
- Numbers k such that the continued fraction for sqrt(k) has period 46.at n=42A020385
- 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 37.at n=22A031535
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x8^2 = n.at n=28A045850
- G.f.: g.f. for A001411 / g.f. for A004018.at n=9A046106
- a(n) = 9*a(n-1) - a(n-2) for n > 0, a(0)=1, a(-1)=1.at n=4A070998
- Sum of first n 4-almost primes.at n=36A086046
- a(1) = 2, thereafter a(n) = Sum_{k=1..n-1} floor(a(n-k)/k).at n=20A100483
- T(n,m) is the smallest number that starts a sequence of n+1 consecutive integers whose Euler totient Functions are multiples of m.at n=49A128252
- Position of cubes in the EKG sequence (A064413).at n=17A140418
- 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, 0), (1, 0, -1), (1, 0, 0), (1, 1, 0)}.at n=7A150330
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + ((n+1)*(n+2)/2)*T(n-2, k-1), read by rows.at n=24A154227
- Numbers k such that 23*10^(k + 2) + 57 is prime.at n=17A160404
- Number of rhombuses on a (n+1) X 6 grid.at n=45A190094
- Potential magic constants of a 10 X 10 magic square composed of consecutive primes.at n=5A192087
- a(n) = n^4 + 3*n^3 - 3*n.at n=7A192398
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 3 4 6 or 7.at n=6A252544
- Number of (1+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 3 4 6 or 7.at n=3A252545
- Numbers n such that n + 15, n^2 + 15 and n^3 + 15 are prime.at n=42A253143