5319
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 2601
- 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
- 3528
- Möbius Function
- 0
- Radical
- 591
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T1 for Milarite.at n=45A008256
- a(n) = T(n,n), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=0.at n=11A026569
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=12A031781
- Number of flat partitions of n: partitions {a_i} with each |a_i - a_{i-1}| <= 1.at n=52A034296
- Number of partitions of n with equal number of parts congruent to each of 1 and 4 (mod 5).at n=42A035558
- Smallest number that takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k".at n=16A035932
- Smallest number that can be made to take n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".at n=17A035934
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(2,5) + cn(3,5).at n=30A039845
- Smallest multiple of 2n+1 with the property that its digits are odd and each digit is two less (mod 10) than the previous digit, or 0 if no such number exists.at n=13A062887
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.at n=27A079094
- Expansion of x/(1 - 3*x - 6*x^2).at n=7A083858
- Sum of the left diagonal in ordered 3 X 3 prime squares.at n=30A105090
- Number of partitions of n into parts that are primes or squares of primes.at n=53A111901
- Smallest number m such that A114228(m) = n.at n=31A114229
- a(n) = ceiling((Pi^n)*(e^n)).at n=3A121246
- G.f. A(x) satisfies: [x^(2n)] A(x)/Catalan(x)^n = A001764(n) = C(3n,n)/(2n+1) and [x^(2n+1)] A(x)/Catalan(x)^n = A001764(n+1) for n>=0, where Catalan(x) is the g.f. of A000108.at n=8A127927
- 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, 0, 1), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A149640
- G.f.: A(x) = exp( Sum_{n>=1} sigma(n)*x^n/(1+x^n) /n ).at n=41A158441
- First of two consecutive numbers with at least one 3 in their prime signature.at n=25A176313
- Numbers k such that Mordell's equation y^2 = x^3 - k has exactly 8 integral solutions.at n=22A179168