Base | Representation |
---|---|
bin | 1001100111101011… |
… | …01000111010010001 |
3 | 111022221020020112221 |
4 | 10303311220322101 |
5 | 41034123312023 |
6 | 2212252421041 |
7 | 241661640526 |
oct | 46365507221 |
9 | 14287206487 |
10 | 5164666513 |
11 | 2210357436 |
12 | 1001777781 |
13 | 643cc43b6 |
14 | 36dcc714d |
15 | 20363185d |
hex | 133d68e91 |
5164666513 has 2 divisors, whose sum is σ = 5164666514. Its totient is φ = 5164666512.
The previous prime is 5164666511. The next prime is 5164666547. The reversal of 5164666513 is 3156664615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4737293584 + 427372929 = 68828^2 + 20673^2 .
It is a cyclic number.
It is not a de Polignac number, because 5164666513 - 21 = 5164666511 is a prime.
Together with 5164666511, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 5164666513.
It is not a weakly prime, because it can be changed into another prime (5164666511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2582333256 + 2582333257.
It is an arithmetic number, because the mean of its divisors is an integer number (2582333257).
Almost surely, 25164666513 is an apocalyptic number.
It is an amenable number.
5164666513 is a deficient number, since it is larger than the sum of its proper divisors (1).
5164666513 is an equidigital number, since it uses as much as digits as its factorization.
5164666513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 388800, while the sum is 43.
The square root of 5164666513 is about 71865.6142602288. The cubic root of 5164666513 is about 1728.5452830580.
The spelling of 5164666513 in words is "five billion, one hundred sixty-four million, six hundred sixty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •