5599
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6120
- Proper Divisor Sum (Aliquot Sum)
- 521
- 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
- 5080
- Möbius Function
- 1
- Radical
- 5599
- Omega Function (Ω)
- 2
- 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
- 67
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Representation degeneracies for boson strings.at n=29A005292
- Coordination sequence T1 for Zeolite Code EPI.at n=47A008090
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=31A020393
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=28A027865
- The 5x + 1 sequence beginning at 7.at n=27A028389
- [ exp(2/19)*n! ].at n=6A030876
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=27A031896
- Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=29A036056
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=1A045132
- Numbers whose base-5 representation contains exactly two 3's and three 4's.at n=11A045303
- Birthday set of order 9: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7, 8 and 9.at n=35A057541
- a(n) = floor((4/3)^n).at n=30A064628
- Numbers k such that prime(k) == -1 (mod sigma(k)).at n=15A067696
- Values of floor((4/3)^n) that are composite.at n=19A070761
- a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=44A074336
- a(n) = index of the triangular number A076971(n).at n=23A076972
- a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4)], where SORT places digits in ascending order and deletes 0's.at n=21A108565
- Semiprimes (A001358) made of nontrivial runs of identical digits.at n=13A116063
- Least number k such that A070635(k) = n.at n=27A138791
- 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, 1, -1), (1, 1, 1)}.at n=7A149727