Base | Representation |
---|---|
bin | 100101001011101100010… |
… | …1111101111100001001001 |
3 | 200002112201020211102020012 |
4 | 1022113120233233201021 |
5 | 1132212000220242001 |
6 | 14511355153441305 |
7 | 1035132204416465 |
oct | 112273057574111 |
9 | 20075636742205 |
10 | 5110352509001 |
11 | 16a0319845923 |
12 | 6a6506870235 |
13 | 2b0b9a61537c |
14 | 1394b16cb4a5 |
15 | 8cdea74b2bb |
hex | 4a5d8bef849 |
5110352509001 has 2 divisors, whose sum is σ = 5110352509002. Its totient is φ = 5110352509000.
The previous prime is 5110352508967. The next prime is 5110352509007. The reversal of 5110352509001 is 1009052530115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3785655096976 + 1324697412025 = 1945676^2 + 1150955^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5110352509001 is a prime.
It is a super-3 number, since 3×51103525090013 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (5110352509007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555176254500 + 2555176254501.
It is an arithmetic number, because the mean of its divisors is an integer number (2555176254501).
Almost surely, 25110352509001 is an apocalyptic number.
It is an amenable number.
5110352509001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110352509001 is an equidigital number, since it uses as much as digits as its factorization.
5110352509001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6750, while the sum is 32.
The spelling of 5110352509001 in words is "five trillion, one hundred ten billion, three hundred fifty-two million, five hundred nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •