Base | Representation |
---|---|
bin | 1001010110000110… |
… | …01001011010100101 |
3 | 110221122202210210012 |
4 | 10223003021122211 |
5 | 40233401300311 |
6 | 2145504140005 |
7 | 235221413633 |
oct | 45303113245 |
9 | 13848683705 |
10 | 5017212581 |
11 | 21450a4087 |
12 | b80307605 |
13 | 61c5a7354 |
14 | 3584a2353 |
15 | 1e570678b |
hex | 12b0c96a5 |
5017212581 has 2 divisors, whose sum is σ = 5017212582. Its totient is φ = 5017212580.
The previous prime is 5017212539. The next prime is 5017212583. The reversal of 5017212581 is 1852127105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4859484100 + 157728481 = 69710^2 + 12559^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5017212581 is a prime.
It is a super-2 number, since 2×50172125812 = 50344844165889363122, which contains 22 as substring.
Together with 5017212583, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5017212583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2508606290 + 2508606291.
It is an arithmetic number, because the mean of its divisors is an integer number (2508606291).
Almost surely, 25017212581 is an apocalyptic number.
It is an amenable number.
5017212581 is a deficient number, since it is larger than the sum of its proper divisors (1).
5017212581 is an equidigital number, since it uses as much as digits as its factorization.
5017212581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5600, while the sum is 32.
The square root of 5017212581 is about 70832.2848777307. The cubic root of 5017212581 is about 1711.9359059631.
Adding to 5017212581 its reverse (1852127105), we get a palindrome (6869339686).
The spelling of 5017212581 in words is "five billion, seventeen million, two hundred twelve thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •