Base | Representation |
---|---|
bin | 100100110110000111101… |
… | …0111001110100011001011 |
3 | 122221010010112220220212022 |
4 | 1021230033113032203023 |
5 | 1130432110143023011 |
6 | 14434214113035055 |
7 | 1031602145250515 |
oct | 111541727164313 |
9 | 18833115826768 |
10 | 5064024189131 |
11 | 16827056aa466 |
12 | 699537555a8b |
13 | 2a96c6461c4b |
14 | 137158888bb5 |
15 | 8bad83c68db |
hex | 49b0f5ce8cb |
5064024189131 has 2 divisors, whose sum is σ = 5064024189132. Its totient is φ = 5064024189130.
The previous prime is 5064024189113. The next prime is 5064024189139. The reversal of 5064024189131 is 1319814204605.
Together with previous prime (5064024189113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5064024189131 - 222 = 5064019994827 is a prime.
It is a super-3 number, since 3×50640241891313 (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 (5064024189139) 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, 2532012094565 + 2532012094566.
It is an arithmetic number, because the mean of its divisors is an integer number (2532012094566).
Almost surely, 25064024189131 is an apocalyptic number.
5064024189131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5064024189131 is an equidigital number, since it uses as much as digits as its factorization.
5064024189131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 44.
The spelling of 5064024189131 in words is "five trillion, sixty-four billion, twenty-four million, one hundred eighty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •