5689
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
- 2
- Divisor Sum
- 5690
- 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
- 5688
- Möbius Function
- -1
- Radical
- 5689
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 749
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Positions of remoteness 6 in Beans-Don't-Talk.at n=47A005694
- From George Gilbert's marks problem: jumping 7 marks at a time (initial positions).at n=20A019997
- Numbers k such that the continued fraction for sqrt(k) has period 89.at n=4A020428
- Fibonacci sequence beginning 5, 12.at n=14A022137
- Conjecturally, number of infinitely recurring prime patterns of width 2n-1.at n=23A023189
- Primes that remain prime through 3 iterations of function f(x) = 3x + 10.at n=33A023280
- Primes that remain prime through 3 iterations of function f(x) = 5x + 2.at n=10A023283
- Primes that remain prime through 3 iterations of function f(x) = 7x + 6.at n=11A023290
- Primes that remain prime through 4 iterations of function f(x) = 7x + 6.at n=4A023318
- Convolution of Lucas numbers and odd numbers.at n=12A023620
- Arrange digits of cubes in ascending order.at n=19A032553
- Primes p such that p+4 and p+12 are also prime.at n=41A046137
- Sizes of successive balls in D_4 lattice.at n=24A046949
- Primes whose sum of digits is the perfect number 28.at n=5A048517
- Primes for which only two iterations of 'Prime plus its digit sum equals a prime' are possible.at n=30A048524
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.at n=21A049737
- floor[2^n/Fibonacci(n)].at n=36A057861
- Primes p such that p and p^2 have same digit sum.at n=11A058370
- Primes p such that p^8 reversed is also prime.at n=35A059701
- Primes with 11 as smallest positive primitive root.at n=29A061324