13829
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13830
- 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
- 13828
- Möbius Function
- -1
- Radical
- 13829
- 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
- 45
- 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
- 1634
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Next prime after n^3.at n=24A014220
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 64 ones.at n=32A031832
- Number of leaves on the rooted tree of height n constructed by the following rule. Assign weight 1 to the single node at height 1. At each node of weight w at height k>0, branch to nodes at height k+1 as follows: one node of weight 1 and a node of weight d+1 if d divides w.at n=10A054657
- Numbers k such that sigma(phi(sigma(k))) = phi(sigma(phi(k))).at n=13A067160
- Primes p such that p-5 == 0 (mod phi(p-5)).at n=32A067557
- a(n) = n^3 + 5.at n=24A084381
- Smallest member of a pair of consecutive twin prime pairs that have three primes between them.at n=17A089635
- Upper prime of a difference of 22 between consecutive primes.at n=25A098976
- Primes p = prime(k) such that both p+2 and prime(k+6)-2 are prime numbers.at n=32A105413
- Primes p such that p + 2 and p*(p + 2) + 2 are primes.at n=28A108013
- Primes congruent to 28 mod 37.at n=39A142137
- Primes congruent to 26 mod 43.at n=35A142275
- Primes congruent to 11 mod 47.at n=34A142362
- Primes congruent to 49 mod 53.at n=29A142579
- Primes congruent to 24 mod 55.at n=39A142618
- Primes congruent to 23 mod 59.at n=31A142750
- Primes congruent to 43 mod 61.at n=25A142841
- Numbers n with property that n^2 is a concatenation of three 3-digit primes.at n=11A153139
- Lesser of twin primes p1 such that p1+(p2^2-p1^2) and p2+(p2^2-p1^2) are prime numbers.at n=25A174922
- Primes of form 4k+1 where k is a Pythagorean prime.at n=35A175600