11633
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11634
- 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
- 11632
- Möbius Function
- -1
- Radical
- 11633
- 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
- 50
- 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
- 1399
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 43.at n=30A020382
- Number of distinct prime signatures of the positive integers up to 2^n.at n=49A025488
- Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3.at n=17A045693
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=24A059287
- Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.at n=18A059669
- Zero, together with positive numbers k such that prime(k) + k is a square.at n=40A064371
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.at n=29A070184
- Smallest prime that is obtained by placing digits on both sides of the n-th prime. Or smallest prime that encompasses the n-th prime.at n=37A075595
- Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.at n=31A079796
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 12.at n=9A095673
- Primes p such that q-p = 24, where q is the next prime after p.at n=16A098974
- Numbers n such that prime(n) + n is a perfect power.at n=45A107605
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=26A109561
- Primes of the form p^2 + q^10 where p and q are primes.at n=8A122716
- Penta-Primes. Prime Numbers n as a Sum of 5 consecutive prime numbers (four twin primes and single prime number in between) are primes.at n=7A138397
- Primes of the form 2*3*5*7*n+83.at n=28A141570
- Primes congruent to 15 mod 37.at n=43A142124
- Primes congruent to 30 mod 41.at n=37A142227
- Primes congruent to 23 mod 43.at n=34A142272
- Primes congruent to 24 mod 47.at n=30A142375