14563
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14564
- 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
- 14562
- Möbius Function
- -1
- Radical
- 14563
- 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
- 19
- 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
- 1708
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(2^n / n).at n=17A000799
- Positions of remoteness 2 in Beans-Don't-Talk.at n=7A005698
- Smallest start for a '3x+1' sequence containing 2^n.at n=15A010120
- Smallest start for a '3x+1' sequence containing 2^n.at n=16A010120
- Palindromic primes in base 8.at n=35A029976
- Decimal part of a(n)^(1/3) starts with reversal of its integer part: first term of runs.at n=22A034309
- Number of binary rooted trees with n nodes and height exactly 7.at n=18A036596
- Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,0.at n=6A037667
- The smallest initial prime of 2 non-overlapping d-twin primes if the distance between pairs (D) is minimal (see A052380).at n=13A052381
- Smallest number to give 2^(2n) in a hailstone (or 3x + 1) sequence.at n=7A054646
- Smallest prime p such that sum of p and the next n-1 primes is a perfect square, or 1 if no such prime exists.at n=28A073887
- Primes for which the four closest primes are smaller.at n=32A075030
- Primes for which the five closest primes are smaller.at n=5A075037
- Primes for which the six closest primes are smaller.at n=1A075038
- a(n) = floor of (2^n-1)/n.at n=17A082482
- Numerator of the probability that the sum of n uniform picks on [0,1] is first greater than 2 (i.e., the sum of n-1 is not).at n=19A090137
- Initial values for 3x+1 trajectories in which the largest term arising in the iteration is a power of 2.at n=38A095381
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 8.at n=29A109562
- a(n) = sum(2^(A047240(i)-1), i=1..n).at n=7A113854
- Terms in A006512 containing the digit "6" at least once, such that changing every "6" to a "9" and vice versa yields a larger term in A006512.at n=4A123211