10949
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10950
- 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
- 10948
- Möbius Function
- -1
- Radical
- 10949
- 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
- 42
- 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
- 1330
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (5^k - 1)/4 is prime.at n=11A004061
- Next prime after n-th Fibonacci number.at n=21A014208
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=25A020376
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=15A028948
- Number of partitions satisfying (cn(0,5) <= cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=51A036813
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=35A054999
- Sum of a(n) terms of 1/k^(6/7) first exceeds n.at n=20A056183
- a(n) = (1/3!)*(n^3 + 24*n^2 + 107*n + 90), compare A059604.at n=33A059605
- a(n) is smallest prime > 2*a(n-1), a(1) = 3.at n=11A065545
- Primes expressible as the sum of (at least two) consecutive primes in at least 3 ways.at n=17A067379
- Primes which are sandwiched between two numbers having the same unordered canonical form.at n=33A074460
- Balanced primes of order eight.at n=19A096700
- a(n) = 8*n^2 - 3.at n=36A108928
- a(1) = 1; a(n) = nextprime(2*a(n-1)) for n > 1.at n=12A110930
- Number of partitions of n having exactly 1 part that appears exactly once.at n=43A116596
- Triangle read by rows in which row n lists prime factors of p^p - 1 where p = prime(n).at n=25A125135
- Primes p that divide Fibonacci[(p-1)/7].at n=13A125253
- Least prime factor of Sum_{k=0..n-1} n^k.at n=15A125571
- Primes that can be written as the sum of 13 consecutive primes.at n=39A127341
- Smallest prime >= n-th Fibonacci number.at n=21A138185