5589
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 3147
- 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
- 3564
- Möbius Function
- 0
- Radical
- 69
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 36
- 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
- Numbers k such that 9*2^k - 1 is prime.at n=22A002236
- Coordination sequence T1 for Zeolite Code DOH.at n=46A008078
- Coordination sequence T3 for Zeolite Code MTT.at n=46A008191
- (s(n)+s(n+1))/6, where s()=A006521.at n=15A016059
- (s(n)+s(n+1))/18, where s()=A006521.at n=18A016060
- Lucky numbers that are the sum of the first k primes for some k.at n=5A046286
- Odd numbers divisible by exactly 6 primes (counted with multiplicity).at n=14A046319
- 24-gonal numbers: a(n) = n*(11*n-10).at n=23A051876
- Composite numbers arising as sum of first k primes.at n=45A053790
- Number of partitions of n in which number of parts is not 2.at n=30A058984
- a(n) = (2*n - 1)*(11*n^2 - 11*n + 6)/6.at n=11A063492
- The least k such that A063994(k) = Product_{primes p dividing k} gcd(p-1, k-1) = n, or 0 if there's no such k.at n=43A064234
- a(n) is the (n+1)st (n+2)-gonal number.at n=22A064808
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=6A072016
- a(0) = 1; for n >= 1, a(n) = 4*a(n-1) - (2^n - 1).at n=7A079319
- a(1) = 7 then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=27A083994
- Numbers n such that n is not the power of a prime and such that for every prime divisor p of n, p-1 divides n-1.at n=21A087442
- Concatenate pairs of successive Fibonacci numbers.at n=10A092778
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, for n>4: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5)], where SORT places digits in ascending order and deletes 0's.at n=46A108566
- Sum of first 2n primes.at n=26A109722