11003
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11004
- 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
- 11002
- Möbius Function
- -1
- Radical
- 11003
- 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
- 73
- 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
- 1336
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Reflectable emirps.at n=17A007628
- Smallest prime with "n^2" as central digit(s).at n=10A038370
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=2A045156
- Primes associated with A052507.at n=35A052480
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=27A054808
- Primes whose sum of digits is 5.at n=18A062341
- Numbers k such that 54^k - 53^k is prime.at n=4A062620
- Primes which, although they have correct parity, are not in the prime number maze.at n=19A065123
- Primes with arithmetic mean of digits = 1 (sum of digits = number of digits).at n=8A069710
- Let u(1) = u(2) = v(1) = v(2) = 1, u(n+2) = u(n)+v(n+1), v(n+2) = abs(u(n)-v(n+1)), then a(n) = u(n).at n=49A072515
- Duplicate of A069710.at n=8A073903
- Members of A083989 whose 10's complement is also a member of A083989.at n=20A083991
- Prime numbers such that first reversing digits and after squaring equals the result of first-squaring and after-reversing. Primes in A085305.at n=23A085306
- Smallest n-digit prime beginning with prime(n), or 0 if no such prime exists.at n=4A088104
- For any prime p, define a sequence S_p: S_p(1) = p and S_p(n+1) is the least prime > S_p(n) that begins with the last digit of S_p(n). Let f(p) be the first member of S_p that is the digit reversal of the previous member. Sequence contains primes p that such that f(p) does not equal f(q) for any q < p.at n=9A089592
- Primes p such that q-p = 24, where q is the next prime after p.at n=15A098974
- Primes of the form 47n+5.at n=31A100760
- Primes of the form 100*n + 3.at n=34A101780
- Primes from merging of 5 successive digits in decimal expansion of cos(1).at n=8A104961
- 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=24A109561