4517
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
- 4518
- 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
- 4516
- Möbius Function
- -1
- Radical
- 4517
- 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
- 38
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 613
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=27A015993
- Numbers k such that the continued fraction for sqrt(k) has period 25.at n=19A020364
- Pisot sequence T(7,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=31A020752
- Initial members of prime triples (p, p+2, p+6).at n=36A022004
- Primes that remain prime through 2 iterations of the function f(x) = 2x + 7.at n=42A023244
- Primes that remain prime through 3 iterations of function f(x) = 10x + 9.at n=22A023301
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=20A045107
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=12A049974
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 9.at n=18A050958
- Sum of digits of prime p is substring of p.at n=37A052019
- Prime number spiral (clockwise, West spoke).at n=12A054570
- Fourth term of strong prime quintets: p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m).at n=12A054811
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.at n=27A065217
- Exponents in expansion of rank-2 Artin constant product(1-1/(p^3-p^2), p=prime) as a product zeta(n)^(-a(n)).at n=30A065417
- Primes p such that p^6 + p^3 + 1 is prime.at n=24A066100
- Smallest prime equal to n^2 + m^2 with n<m.at n=45A068487
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (4,2).at n=38A073649
- a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=32A074343
- Number of primes corresponding to n-th primeval number A072857(n).at n=46A076497
- Primes of the form x^2 + (x+3)^2.at n=13A076727