11317
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11318
- 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
- 11316
- Möbius Function
- -1
- Radical
- 11317
- 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
- 130
- 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
- 1368
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of restricted solid partitions of n.at n=18A002974
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 23.at n=3A031611
- Super-4 Numbers (4 * n^4 contains substring '4444' in its decimal expansion).at n=6A032744
- Smallest number with exactly n prime substrings.at n=10A035244
- Smallest positive number containing n e's when spelled out in US English.at n=10A036448
- To form the sequence, write the primes 2, 3, 5, 7,... as an infinite string 2357111317...; then take the first 2 digits of the string, 23, then the next 3 digits, 571, then the next 5 digits, 11317, then the next 7 digits, 1923293, then... (stepping through prime numbers of digits). Omit any leading 0's.at n=2A043347
- Primes p for which the period of reciprocal 1/p is (p-1)/12.at n=14A056217
- Primes p such that x^41 = 2 has no solution mod p.at n=34A059236
- Primes which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).at n=19A069246
- Primes > 1000 in which every substring of lengths 2 and 3 are also prime.at n=8A069490
- Take A000040, omit commas: 23571113171923..., select 5-digit primes seen when scanning from left.at n=1A073038
- Smallest prime with memory = n.at n=9A079397
- Primes p of the form 2*prime(k) + 3 such that 2*prime(k+1) + 3 is the next prime after p.at n=26A089528
- Earliest positive integer having embedded exactly k distinct primes.at n=10A093301
- Prime numbers which when written in base 7 have a composite digit-sum.at n=4A096790
- Primes p such that p's set of distinct digits is {1,3,7}.at n=9A108382
- Primes arising in A110798.at n=2A110799
- Primes such that the sum of the predecessor and successor primes is divisible by 41.at n=30A113157
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=38A117725
- Primes which are the sum of a twin prime pair + 1.at n=35A118071