11047
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11048
- 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
- 11046
- Möbius Function
- -1
- Radical
- 11047
- 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
- 68
- 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
- 1338
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of paraffins.at n=28A006001
- Coordination sequence for MgNi2, Position Mg1.at n=26A009936
- Upper prime of a difference of 20 between consecutive primes.at n=18A031939
- Primes followed by a [10,2,10] prime difference pattern of A001223.at n=14A052376
- Third term of strong prime 5-tuples: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=27A054810
- Number of partitions of the unit square into 2^n dyadic rectangles, each of area 2^{-n}.at n=4A062764
- Subprimorials, extrapolation from primorials by analogy with subfactorials.at n=6A079266
- Class 6+ primes.at n=8A081634
- Numbers m such that (15m-4, 15m-2, 15m+2, 15m+4) is a prime quadruple.at n=45A112540
- Last entry (and high point) in segment n of A079051.at n=38A117516
- Cyclops primes.at n=16A134809
- Primes of the form 15x^2+88y^2.at n=40A140006
- Primes of the form 42x^2+42xy+43y^2.at n=39A140028
- Primes of the form 4x^2+4xy+463y^2.at n=40A140030
- Primes of the form 88x^2+32xy+127y^2.at n=21A140630
- a(n) is the first term that can be reduced in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n), such that b is always 7 so that each interpretation is base 8. Terms already fully reduced (i.e., single digits) are excluded.at n=5A141841
- Primes congruent to 21 mod 37.at n=32A142130
- Primes congruent to 18 mod 41.at n=31A142215
- Primes congruent to 39 mod 43.at n=35A142288
- Primes congruent to 2 mod 47.at n=23A142355