14503
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14504
- 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
- 14502
- Möbius Function
- -1
- Radical
- 14503
- 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
- 164
- 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
- 1699
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=29A022905
- Primes that remain prime through 3 iterations of function f(x) = 9x + 4.at n=31A023297
- Values of A038005 ending in 3.at n=14A038013
- Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2).at n=28A058036
- Triangle of numbers arising in recursive computation of A002212.at n=39A073149
- Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists.at n=28A079451
- Order in which prime factors first occur in the Lucas sequence.at n=28A096362
- Primes p such that little googol + p is prime.at n=30A108255
- Primes p such that 6p + 7 is a square.at n=39A110014
- Numerator of Sum/Product of first n Fibonacci numbers A000045[n].at n=51A121708
- Primes p that divide Fibonacci[(p+1)/7].at n=23A125252
- Primes of the form 210n + 13.at n=35A140841
- Primes congruent to 27 mod 47.at n=37A142378
- Primes congruent to 48 mod 49.at n=40A142455
- Primes congruent to 34 mod 53.at n=31A142564
- Primes congruent to 48 mod 59.at n=32A142775
- Primes congruent to 46 mod 61.at n=27A142844
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 8; primes in A146333.at n=13A146353
- a(n) = 49*n^2 - 78*n + 31.at n=17A157368
- a(n) = 392*n - 1.at n=36A158004