14003
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16320
- Proper Divisor Sum (Aliquot Sum)
- 2317
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11880
- Möbius Function
- -1
- Radical
- 14003
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Trajectory of 5 under map x->x + (x-with-digits-reversed).at n=10A033649
- Trajectory of 13 under map x->x + (x-with-digits-reversed).at n=7A033652
- Trajectory of 17 under map x->x + (x-with-digits-reversed).at n=6A033654
- Trajectory of 31 under map x->x + (x-with-digits-reversed).at n=7A033661
- Trajectory of 79 under map x->x + (x-with-digits-reversed).at n=5A033673
- Numbers whose base-7 representation contains exactly four 5's.at n=23A043416
- Nearest integer to log(n^n)^(1 + log(1 + log(n))).at n=19A062450
- n*10^4-1, n*10^4-3, n*10^4-7 and n*10^4-9 are all prime.at n=2A064978
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=31A070192
- a(n) = 9*n^2 - 10*n + 3.at n=40A154262
- n such that A205592(n) > n.at n=7A205594
- n-th term of the 'Reverse and Add!' sequence starting with n.at n=9A244058
- Number of length n+1 0..6 arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=4A250275
- T(n,k)=Number of length n+1 0..k arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=49A250277
- Number of length 5+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=5A250280
- a(n) is the number of primes between (prime(n))^3 and (prime(n+1))^3.at n=42A365767
- Least composite squarefree numbers k > n such that p + n divides k - n, for each prime p dividing k.at n=37A382484
- a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1)<=prime(n), otherwise a(n) = a(n-1)-prime(n).at n=33A382619
- Smallest positive integer with shortest addition-subtraction chain of length n.at n=18A383142