14897
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14898
- 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
- 14896
- Möbius Function
- -1
- Radical
- 14897
- 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
- 115
- 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
- 1746
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Quartan primes: primes of the form x^4 + y^4, x > 0, y > 0.at n=17A002645
- Numbers k such that the continued fraction for sqrt(k) has period 93.at n=10A020432
- Smallest k such that f(f(...f(k))) > 1, where f(k) = A065371(k) is iterated n times.at n=9A065374
- a(n) = 6*binomial(n,4) + 5*binomial(n,2) - 4*n + 5.at n=16A066455
- Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).at n=32A066456
- Expansion of (1-x-sqrt(1-2*x-15*x^2))/(8*x^2).at n=8A091147
- Primes with digit sum = 29.at n=35A106766
- 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=31A109562
- Primes p that remain prime through at least 2 iterations of the function f(p) = p^2 + 4.at n=30A116886
- Prime quartet leaders: largest number of a prime quartet.at n=35A119892
- Primes p such that q-p = 26, where q is the next prime after p.at n=6A124594
- Primes with prime "Look And Say" descriptions from right to left (irrespective of method A or method B).at n=36A127179
- Primes of the form k^2 + 13.at n=23A138375
- Primes congruent to 45 mod 47.at n=39A142396
- Primes congruent to 1 mod 49.at n=38A142414
- Primes congruent to 4 mod 53.at n=33A142534
- Primes congruent to 29 mod 59.at n=34A142756
- Primes congruent to 13 mod 61.at n=31A142811
- Prime numbers p such that p - 1 is the fourth a-figurate number and nineteenth b-figurate number for some a and b.at n=13A144327
- a(n) is the minimal prime of the form 4k+1 for which s=A008784(n) is the minimal positive integer such that s*a(n)-floor(sqrt(s*a(n)))^2 is a square.at n=10A145215