14923
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
- 14924
- 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
- 14922
- Möbius Function
- -1
- Radical
- 14923
- 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
- 71
- 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
- 1747
- 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) = 2x + 5.at n=35A023274
- Primes p from A031924 such that A052180(primepi(p)) = 11.at n=29A052232
- Discriminants of imaginary quadratic fields with class number 25 (negated).at n=27A056987
- Numbers k such that 52^k - 51^k is prime.at n=4A062618
- Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).at n=22A067860
- Group the natural numbers such that the n-th group contains n terms and the group sum is the smallest possible prime: (2), (1, 4), (3, 5, 9), (6, 7, 8, 10), (11, 12, 13, 14, 17), (15, 16, 18, 19, 20, 21), ... Sequence gives group sums.at n=30A075345
- Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.at n=21A088291
- n-th prime in the arithmetic progression n+k*(n+1) with k>0.at n=39A088733
- Primes p such that the polynomial x^5-x^4-x^3-x^2-x-1 mod p has 5 distinct zeros.at n=12A106281
- Primes that do not divide any term of the Lucas 5-step sequence A074048.at n=7A106301
- Prime numbers p for which quintonacci quintic polynomial x^5-x^4-x^3-x^2-x-1 modulus p is completely factorizable.at n=13A135846
- Prime numbers p not of the form 10k+1 for which the quintonacci quintic polynomial x^5 - x^4 - x^3 - x^2 - x - 1 modulus p is factorizable into five binomials.at n=10A135847
- Primes of the form 210n + 13.at n=37A140841
- Primes congruent to 40 mod 41.at n=39A142237
- Primes congruent to 24 mod 47.at n=36A142375
- Primes congruent to 27 mod 49.at n=38A142437
- Primes congruent to 30 mod 53.at n=33A142560
- Primes congruent to 55 mod 59.at n=28A142782
- Primes congruent to 39 mod 61.at n=25A142837
- Greatest number m such that the fractional part of (10/9)^A153694(n) <= 1/m.at n=8A153698