13999
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14000
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13998
- Möbius Function
- -1
- Radical
- 13999
- 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
- 89
- 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
- 1652
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of n-node connected unicyclic graphs.at n=10A001429
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=27A007996
- Expansion of 1/((1-6x)(1-7x)(1-10x)(1-12x)).at n=3A028208
- Number of partitions of n with equal number of parts congruent to each of 2 and 4 (mod 5).at n=45A035560
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=13A049947
- a(n) = smallest k such that 5k has a digit sum = n.at n=37A077492
- Smallest prime whose product of digits is 3^n.at n=7A088653
- Irregular primes whose indices are irregular primes of order one.at n=42A090869
- For n > 0, a(n+1) is the least prime not already used such that abs(a(n+1)-a(n))/2n is prime.at n=67A093932
- Prime numbers which when written in base 7 have a composite digit-sum.at n=12A096790
- Primes with digit sum = 31.at n=16A106767
- Primes p such that p's set of distinct digits is {1,3,9}.at n=30A108383
- Largest prime factor of A023199(n).at n=15A108402
- Least prime whose absolute difference between the sum of its even decimal digits and the sum of its odd decimal digits is n.at n=31A114442
- Array read by columns: T(n,m) = number of unlabeled graphs with n vertices and m unicyclic components.at n=22A137918
- Primes congruent to 18 mod 41.at n=36A142215
- Primes congruent to 24 mod 43.at n=38A142273
- Primes congruent to 40 mod 47.at n=32A142391
- Primes congruent to 7 mod 53.at n=31A142537
- Primes congruent to 34 mod 57.at n=40A142686