5915
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8784
- Proper Divisor Sum (Aliquot Sum)
- 2869
- 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
- 3744
- Möbius Function
- 0
- Radical
- 455
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 173
- Smith Number
- yes
- 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
- 4-dimensional figurate numbers: a(n) = n*binomial(n+2, 3).at n=12A002417
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=24A002624
- Number of walks on square lattice.at n=9A005565
- Coordination sequence T3 for Zeolite Code CAS.at n=47A008065
- a(n) = 91*(n+1)*binomial(n+3,14)/3.at n=1A027799
- a(n) = a(n-1)+ a(round(2*(n-1)/3)) +a(round((n-1)/3)) starting a(1)=1.at n=27A033498
- Number of labeled 3-trees with n nodes.at n=6A036362
- Numerators of continued fraction convergents to sqrt(866).at n=4A042672
- (s(n)+1)/9, where s(n)=n-th base 9 palindrome that starts with 8.at n=29A043079
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^13 in powers of x.at n=11A047638
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 3 skipped primes.at n=40A050770
- Sum of transposition distances (divided by 2) present in the permutation produced by inverses of 1..(p-1) computed in Zp, where p is n-th prime.at n=44A051864
- Coefficients of the '6th-order' mock theta function sigma(q).at n=48A053271
- Numbers m such that there are precisely 3 groups of order m.at n=29A055561
- Numbers k such that the Lucas Aurifeuillian primitive part B of Lucas(k) is prime.at n=46A061443
- Numbers that are sums of 2 or more consecutive squares in more than 1 way.at n=12A062681
- a(n) = floor(log(n)*2^n/n).at n=14A065613
- a(1) = 1, a(2) = 2, a(n) = (n-1)*a(n-1) - (n-2)*a(n-2).at n=8A067078
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=17A067355
- Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.at n=21A069043