14983
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14984
- 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
- 14982
- Möbius Function
- -1
- Radical
- 14983
- 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
- 1754
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 4 iterations of function f(x) = 3x + 10.at n=13A023310
- Fourth term of weak prime quintets: p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=36A054826
- Fifth term of weak prime quintets: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1).at n=35A054827
- Fifth term of weak prime sextet: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m).at n=3A054832
- Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).at n=16A087580
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 9.at n=18A109563
- A004001[n + 1]*Fibonacci[n + 1] - 2*A004001[n]*Fibonacci[n] + A004001[n - 1]*Fibonacci[n - 1].at n=19A120472
- Primes p such that q-p = 30, where q is the next prime after p.at n=16A124596
- Primes that are simultaneously of the forms 24i+7 and 7j+24.at n=37A137657
- Primes of the form 210k + 73.at n=37A140857
- Primes congruent to 18 mod 41.at n=40A142215
- Primes congruent to 37 mod 47.at n=37A142388
- Primes congruent to 38 mod 49.at n=39A142446
- Primes congruent to 37 mod 53.at n=32A142567
- Primes congruent to 56 mod 59.at n=33A142783
- Primes congruent to 38 mod 61.at n=29A142836
- Natural growth of an aliquot sequence driven by a perfect number 2^(p-1)*((2^p) - 1).at n=21A146556
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0100-1100-0111 pattern in any orientation.at n=14A146582
- Five-digit mountain-type primes that increase to and decrease from the central digit, including palindromes.at n=35A156116
- Numbers k such that Sum_{i=1..k} i^7 divides Product_{i=1..k} i^7.at n=12A166607