14851
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
- 14852
- 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
- 14850
- Möbius Function
- -1
- Radical
- 14851
- 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
- 133
- 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
- 1740
- 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) = 4x + 3.at n=38A023281
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 80 ones.at n=10A031848
- a(n) = floor(n^3 / Pi).at n=36A032633
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(0,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=35A039903
- Primes whose consecutive digits differ by 3 or 4.at n=30A048415
- Primes p such that p and p^2 have same digit sum.at n=24A058370
- Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.at n=44A069128
- Primes of the form 5k^2 + 5k + 1.at n=28A090562
- a(n) = (27*n^2 + 9*n + 2)/2.at n=33A093485
- a(n) is the length of a side of triangle A068619(n) or a(n) = (sqrt(8*A068619(n) + 1) - 1)/2.at n=5A100243
- a(0)=1, a(1)=1, a(n) = 11*a(n/2) for even n, and a(n) = 10*a((n-1)/2) + a((n+1)/2) for odd n >= 3.at n=19A116525
- Primes for which the weight as defined in A117078 is 23.at n=32A119504
- a(n) = 5*F(n)^2 - 5*F(n) + 1, where F(n) = Fibonacci(n).at n=10A124296
- Centered triangular numbers that are prime.at n=22A125602
- Primes in A132286.at n=33A132287
- Prime numbers p such that p +- ((p-1)/3) are primes.at n=14A137703
- Primes congruent to 16 mod 43.at n=39A142265
- Primes congruent to 46 mod 47.at n=34A142397
- Primes congruent to 4 mod 49.at n=39A142417
- Primes congruent to 11 mod 53.at n=33A142541