8513
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8514
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8512
- Möbius Function
- -1
- Radical
- 8513
- 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
- 127
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1061
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 51.at n=12A020390
- 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 26.at n=2A031614
- Number of partitions of n into parts 3k and 3k+2 with at least one part of each type.at n=54A035619
- T(n,n-3), array T as in A038792.at n=37A038793
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048225.at n=21A048235
- Primes with distinct digits in alphabetical order (in English).at n=30A053435
- 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=24A054810
- Let prime(i) = i-th prime, let twin(n) = (P,Q) be n-th pair of twin primes; sequence gives prime(P).at n=38A057470
- a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a square.at n=14A062064
- Numbers k such that k, 2*k+1, 3*k+2 are primes.at n=39A067256
- a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.at n=35A067773
- Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).at n=8A067860
- Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.at n=7A088291
- Primes which are also prime if their base 64 representation is interpreted as a base 10 number.at n=27A090717
- Initial members of 25 consecutive primes in a 5 X 5 spiral wherein the mean of all 12 sums is prime.at n=19A094458
- Primes of the form 37n+3.at n=33A100203
- Smallest odd prime p such that n=(p-1)/ord_p(3).at n=18A101209
- Indices of primes in sequence defined by A(0) = 51, A(n) = 10*A(n-1) + 11 for n > 0.at n=16A101573
- Primes of the form 128n+65.at n=18A105129
- Numbers k such that (10's complement factorial of k) - 1 is prime.at n=17A109617