13589
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13824
- Proper Divisor Sum (Aliquot Sum)
- 235
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13356
- Möbius Function
- 1
- Radical
- 13589
- 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
- 63
- 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
- a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 1 mod 3}.at n=12A024220
- n-th 6k+1 prime times n-th 6k-1 prime.at n=13A048629
- a(n) = prime(n)*prime(n+3).at n=27A090090
- X-toothpick sequence on Z^3 lattice (see Comments for precise definition).at n=33A160170
- Sum of the first n strobogrammatic numbers.at n=22A230833
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 2)/(x + 1).at n=45A231732
- Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly two bit positions.at n=40A261074
- Sequence of pairwise relatively prime numbers of class P_8 (see comment in A275246).at n=14A275253
- Numbers k such that A001414(k^4+1) is divisible by k.at n=5A309558
- Number of partitions of n into parts of exactly three sorts which are introduced in ascending order such that sorts of adjacent parts are different.at n=11A320545
- Nested base shift convergence sequence (NBSC): gives the constant term of the convergence of a number n into a base sequence conversion nest: a(n) = ...FromDigits(IntegerDigits(FromDigits(IntegerDigits(n,2),3),4),5)..., until the result does not change for more iterations.at n=24A326653
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=34A345593
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=6A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=6A345852
- a(1) = 1; for n > 1, a(n) is the least odd number k such that A325567(k) = 2*n-1, or 0 if no such number exists.at n=53A379128