11273
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11274
- 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
- 11272
- Möbius Function
- -1
- Radical
- 11273
- 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
- 205
- 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
- 1363
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of integers m <= 2^n such that d(m) = 2^k for some k = 0, 1, 2, 3, ...at n=13A036538
- a(n) is the number of numbers k with 2^(n-1) < k <= 2^n having a number of divisors that is a power of 2.at n=14A036539
- 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=30A075595
- a(1) = 2 and then the smallest prime that is obtained by placing digits on both sides of the previous term. Or smallest prime that encompasses a(n-1).at n=2A075596
- Primes of the form a^4 + b^3 with b>0.at n=25A100271
- Indices of prime Lucas 6-step numbers, A074584.at n=16A105766
- Positive integers of the form (18*m^2+1)/11.at n=15A113338
- Primes that can be written as the sum of 13 consecutive primes.at n=40A127341
- Number of Ferrers diagrams with a single strictly smaller Ferrers puncture with the same orientation removed from the top with half-perimeter = n.at n=7A133107
- Primes congruent to 21 mod 29.at n=43A141997
- Primes congruent to 25 mod 37.at n=41A142134
- Primes congruent to 39 mod 41.at n=33A142236
- Primes congruent to 7 mod 43.at n=30A142256
- Primes congruent to 40 mod 47.at n=27A142391
- Primes congruent to 3 mod 49.at n=34A142416
- Primes congruent to 2 mod 51.at n=42A142477
- Primes congruent to 37 mod 53.at n=23A142567
- Primes congruent to 53 mod 55.at n=34A142639
- Primes congruent to 44 mod 57.at n=39A142692
- Primes congruent to 4 mod 59.at n=21A142731