11239
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11240
- 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
- 11238
- Möbius Function
- -1
- Radical
- 11239
- 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
- 60
- 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
- 1358
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023531.at n=15A024313
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor(n/2), s = (natural numbers >= 3), t = (Fibonacci numbers).at n=14A024315
- Number of partitions of n^3 into distinct cubes.at n=40A030272
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 78 ones.at n=6A031846
- Numbers (with nonzero digits only) where A046810 increases.at n=8A046811
- Smallest number m with nonzero digits such that A046810(m)=n.at n=21A046813
- a(n) is the least integer that has exactly n anagrams that are primes.at n=21A046890
- Primes of the form k^2 + 3.at n=18A049423
- Primes p such that p^10 reversed is also prime.at n=42A059703
- Numerator of 1/3 + 3/5 + 5/7 + ... + (2n - 1)/(2n + 1).at n=5A061484
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=42A064026
- Numbers k such that 10^999 + k is a (titanic) prime.at n=8A074282
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=35A097240
- Primes of the form (k+1)*prime(k) + k*prime(k+1).at n=15A097241
- Duplicate of A049423.at n=18A121825
- Prime arithmetic mean of ten consecutive primes.at n=29A123096
- Smallest prime divisor of 4n^2+3 that is of the form 6k+1.at n=52A125257
- Primes p such that p, p+4 and p+12 are consecutive primes.at n=30A139385
- Primes congruent to 28 mod 37.at n=33A142137
- Primes congruent to 5 mod 41.at n=37A142202