11863
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
- 11864
- 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
- 11862
- Möbius Function
- -1
- Radical
- 11863
- 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
- 37
- 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
- 1422
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=33A015991
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=28A020439
- Numbers k such that the sum of odd primes up to k is palindromic.at n=6A058846
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=23A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=25A059665
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=17A059668
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=32A065215
- Class 6- primes (for definition see A005109).at n=32A081425
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=30A094069
- Smallest prime of the form (prime(n)*prime(n+1)+q)/2 for some integer n and some prime q.at n=34A100557
- Primes p such that p - q = 24, where q is the previous prime before p; or prime numbers preceded by precisely 23 composite numbers.at n=17A126720
- Primes of the form 7x^2+195y^2.at n=38A140018
- Primes congruent to 23 mod 37.at n=39A142132
- Primes congruent to 14 mod 41.at n=37A142211
- Primes congruent to 38 mod 43.at n=31A142287
- Primes congruent to 19 mod 47.at n=30A142370
- Primes congruent to 5 mod 49.at n=38A142418
- Primes congruent to 44 mod 53.at n=24A142574
- Primes congruent to 38 mod 55.at n=36A142628
- Primes congruent to 7 mod 57.at n=42A142669