14149
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14150
- 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
- 14148
- Möbius Function
- -1
- Radical
- 14149
- 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
- 32
- 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
- 1665
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 9 nonzero 8th powers.at n=23A003387
- a(n) = 10000*log_10(n) rounded down.at n=25A004228
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=32A018836
- Numbers k such that the continued fraction for sqrt(k) has period 69.at n=14A020408
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 15.at n=8A031603
- Primes p such that p and p^2 have same digit sum.at n=23A058370
- Primes p such that x^27 = 2 has no solution mod p, but x^9 = 2 has a solution mod p.at n=3A059354
- Primes p such that x^9 = 2 has a solution mod p, but x^(9^2) = 2 has no solution mod p.at n=4A070185
- Duplicate of A089116.at n=14A089099
- Convoluted convolved Fibonacci numbers G_j^(3).at n=14A089116
- Primes of the form (p*q - 2)/5 where p and q are successive primes.at n=2A124684
- Primes of the form 2*3*5*7*n+79.at n=33A141563
- Primes congruent to 2 mod 43.at n=39A142251
- Primes congruent to 2 mod 47.at n=32A142355
- Primes congruent to 37 mod 49.at n=40A142445
- Primes congruent to 51 mod 53.at n=32A142581
- Primes congruent to 14 mod 55.at n=38A142611
- Primes congruent to 48 mod 59.at n=31A142775
- Primes congruent to 58 mod 61.at n=25A142856
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 0, 0), (1, 0, -1), (1, 1, 1)}.at n=8A149551