11467
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11468
- 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
- 11466
- Möbius Function
- -1
- Radical
- 11467
- 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
- yes
- 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
- 1382
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numerator of [x^n] in the Taylor series arccosh(exp(x)-arcsinh(x)).at n=8A013323
- Fibonacci sequence beginning 1, 11.at n=16A022101
- Upper prime of a difference of 20 between consecutive primes.at n=21A031939
- Denominators of continued fraction convergents to sqrt(60).at n=10A041105
- Discriminants of imaginary quadratic fields with class number 13 (negated).at n=28A046010
- a(n) = p is the smallest prime such that p = n + h(n)^2 and p is the first prime following h(n)^2. The smallest immediate post-square primes with distance n = p - h(n)^2.at n=17A058056
- Primes p such that x^49 = 2 has no solution mod p, but x^7 = 2 has a solution mod p.at n=3A059667
- Smallest prime larger than square of n-th prime.at n=27A062772
- Floor(X/Y) where X = concatenation of the (n+1)-st even number through the (2n)-th even number and Y = concatenation of first n even numbers.at n=12A067091
- Primes which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).at n=20A069246
- Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.at n=30A079796
- Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.at n=20A092475
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=17A094933
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-k,k+1) * 3^(n-k-1)*(4/3)^k.at n=7A099621
- Indices of prime hexanacci (or Fibonacci 6-step) numbers A001592 (using offset -4).at n=7A105758
- Cumulative sums of int(prime*e) which are primes.at n=9A117527
- Primes p such that p^2-p-1 and p^2-p+1 are twin primes.at n=28A120364
- Primes congruent to 34 mod 37.at n=34A142143
- Primes congruent to 28 mod 41.at n=31A142225
- Primes congruent to 29 mod 43.at n=34A142278