5659
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5660
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 5658
- Möbius Function
- -1
- Radical
- 5659
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 67
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 746
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=26A024599
- Primes p whose digits do not appear in p^2.at n=50A030086
- 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 75.at n=5A031573
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=5A031824
- Lower prime of a difference of 10 between consecutive primes.at n=70A031928
- Primes that are concatenations of n with n + 3.at n=6A032626
- Numbers whose set of base-7 digits is {2,3}.at n=37A032807
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) < cn(1,5).at n=58A036858
- Primes p such that both p-2 and 2p-1 are prime.at n=35A038869
- Primes p such that x^23 = 2 has no solution mod p.at n=34A040984
- Numbers having three 3's in base 8.at n=31A043435
- Numbers having three 7's in base 9.at n=13A043483
- Discriminants of imaginary quadratic fields with class number 19 (negated).at n=19A046016
- Last member of a sexy prime quadruple: value of p+18 such that p, p+6, p+12 and p+18 are all prime.at n=20A046124
- Euclid-Mullin sequence (A000945) with initial value a(1)=65537 instead of a(1)=2.at n=31A051332
- Primes p such that x^41 = 2 has no solution mod p.at n=17A059236
- Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, in alternating directions. The first entry is 1 each time. For the next element of a diagonal, add to the previous element the elements of the row and the column the new element is in. The final element of each diagonal gives a(n).at n=6A059513
- The array described in A059513 read by antidiagonals in the 'up' direction.at n=21A059574
- The array described in A059513 read by antidiagonals in the direction of construction.at n=27A059575
- Primes for which the three closest primes are smaller.at n=42A074982