11807
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11808
- 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
- 11806
- Möbius Function
- -1
- Radical
- 11807
- 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
- 81
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1415
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest number of complexity n: smallest number requiring n 1's to build using + and *.at n=31A005520
- Primes p such that there is no Carmichael number pqr, p<q<r q, r primes.at n=12A051663
- a(n) is smallest safe prime (A005385) such that a(n) + 12*n is the next safe prime, i.e., x = (a(n) - 1)/2 and x + 6*n are closest Sophie Germain primes.at n=24A059327
- a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a cube.at n=3A062066
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 6*p+1 is also prime.at n=36A075705
- Value of C in y = x^2 + 5x + C such that y is prime for all x = 0 to 3.at n=28A097434
- A Fibonacci convolution.at n=10A099485
- a(n) = (n^5-n-5)/5.at n=9A134327
- Primes of the form 210k + 47.at n=29A140850
- Primes congruent to 4 mod 37.at n=41A142113
- Primes congruent to 40 mod 41.at n=32A142237
- Primes congruent to 25 mod 43.at n=34A142274
- Primes congruent to 10 mod 47.at n=32A142361
- Primes congruent to 47 mod 49.at n=33A142454
- Primes congruent to 26 mod 51.at n=40A142492
- Primes congruent to 41 mod 53.at n=28A142571
- Primes congruent to 37 mod 55.at n=35A142627
- Primes congruent to 8 mod 57.at n=40A142670
- Primes congruent to 7 mod 59.at n=21A142734
- Primes congruent to 34 mod 61.at n=23A142832