Base | Representation |
---|---|
bin | 100110011010010011001… |
… | …1010110000001100000001 |
3 | 200200200102200200122112201 |
4 | 1030310212122300030001 |
5 | 1142443204243312423 |
6 | 15121113510153201 |
7 | 1053256330056121 |
oct | 114644632601401 |
9 | 20620380618481 |
10 | 5279159354113 |
11 | 1755973912077 |
12 | 713177952801 |
13 | 2c3a90303838 |
14 | 143726ad6c81 |
15 | 924ca45e2ad |
hex | 4cd266b0301 |
5279159354113 has 2 divisors, whose sum is σ = 5279159354114. Its totient is φ = 5279159354112.
The previous prime is 5279159354107. The next prime is 5279159354167. The reversal of 5279159354113 is 3114539519725.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4450272927489 + 828886426624 = 2109567^2 + 910432^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5279159354113 is a prime.
It is a super-2 number, since 2×52791593541132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5279159354173) 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, 2639579677056 + 2639579677057.
It is an arithmetic number, because the mean of its divisors is an integer number (2639579677057).
Almost surely, 25279159354113 is an apocalyptic number.
It is an amenable number.
5279159354113 is a deficient number, since it is larger than the sum of its proper divisors (1).
5279159354113 is an equidigital number, since it uses as much as digits as its factorization.
5279159354113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5103000, while the sum is 55.
The spelling of 5279159354113 in words is "five trillion, two hundred seventy-nine billion, one hundred fifty-nine million, three hundred fifty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •