15823
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15824
- 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
- 15822
- Möbius Function
- -1
- Radical
- 15823
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 76
- 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
- 1847
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Denominators of continued fraction convergents to sqrt(497).at n=8A041949
- Primes prime(k) for which A049076(k) = 4.at n=10A049080
- Primes for which A049076 >= 4.at n=17A049090
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.at n=8A054682
- Initial prime in first sequence of n primes congruent to 1 modulo 9.at n=2A057644
- Irregular primes with irregularity index three.at n=25A060975
- Number of winning binary "same game" templates with ternary digits totaling n.at n=21A066346
- 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=24A067860
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=8A070018
- Primes for which the four closest primes are smaller.at n=34A075030
- Primes for which the five closest primes are smaller.at n=7A075037
- 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=23A088291
- Smallest prime(k) such that prime(k)-prime(k-n) is equal to prime(k+1)-prime(k).at n=5A089344
- Primes that do not divide any term of the Lucas 4-step sequence A073817.at n=15A106300
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 11.at n=6A109565
- Primes p such that q-p = 36, where q is the next prime after p.at n=3A134117
- Primes congruent to 31 mod 47.at n=39A142382
- Primes congruent to 29 mod 53.at n=36A142559
- Primes congruent to 11 mod 59.at n=31A142738
- Primes congruent to 24 mod 61.at n=29A142822