14533
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14534
- 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
- 14532
- Möbius Function
- -1
- Radical
- 14533
- 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
- 71
- 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
- 1701
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 8x + 5.at n=16A023293
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 68 ones.at n=17A031836
- Inverse Moebius transform of A001037 (starting at term 0).at n=18A054080
- Irregular primes with irregularity index three.at n=20A060975
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=20A078852
- Primes p such that the differences between the 5 consecutive primes starting with p are (4,6,6,2).at n=8A078956
- n-th prime in the arithmetic progression n+k*(n+1) with k>0.at n=41A088733
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=27A094933
- Numerator of Sum_{i=2..n} (-1)^i/(i*phi(i)).at n=7A101992
- Numbers n such that the sum of the digits of the n-th Fibonacci number written in bases 2, 3, 5 and 7 is prime.at n=27A111064
- Primes of the form 2*p(k)+3*p(k+1)+4*p(k+2) for some k, where p(k)=A000040(k).at n=41A138665
- Primes of the form 210k + 43.at n=36A140849
- Primes congruent to 29 mod 49.at n=41A142438
- Primes congruent to 11 mod 53.at n=31A142541
- Primes congruent to 13 mod 55.at n=39A142610
- Primes congruent to 19 mod 59.at n=28A142746
- Primes congruent to 15 mod 61.at n=31A142813
- a(n) = start of a sequence of at least n consecutive primes, p_1, p_2, ..., p_n (say), all == 1 mod 4, such that A(p_1) > A(p_2) > ... > A(p_n), where A(p) (see A145010) is the area of the Pythagorean triangle with hypotenuse p.at n=6A144954
- Triangle of primes described in A144954, read by rows.at n=21A144960
- Numbers that are the first of two consecutive primes having a sum that is the product of two consecutive numbers.at n=38A154634