Base | Representation |
---|---|
bin | 100100011000110100110… |
… | …1000000010001110111011 |
3 | 122201002202020100222022121 |
4 | 1020301221220002032323 |
5 | 1123414240143111011 |
6 | 14345251410102111 |
7 | 1024214160622024 |
oct | 110615150021673 |
9 | 18632666328277 |
10 | 5001114035131 |
11 | 1658a62548655 |
12 | 6892bab7a937 |
13 | 2a37abb1a356 |
14 | 1340ab6d9c4b |
15 | 8a15542ae71 |
hex | 48c69a023bb |
5001114035131 has 2 divisors, whose sum is σ = 5001114035132. Its totient is φ = 5001114035130.
The previous prime is 5001114035101. The next prime is 5001114035143. The reversal of 5001114035131 is 1315304111005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5001114035131 - 27 = 5001114035003 is a prime.
It is a super-2 number, since 2×50011140351312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5001114035096 and 5001114035105.
It is not a weakly prime, because it can be changed into another prime (5001114035101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500557017565 + 2500557017566.
It is an arithmetic number, because the mean of its divisors is an integer number (2500557017566).
Almost surely, 25001114035131 is an apocalyptic number.
5001114035131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5001114035131 is an equidigital number, since it uses as much as digits as its factorization.
5001114035131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 5001114035131 its reverse (1315304111005), we get a palindrome (6316418146136).
The spelling of 5001114035131 in words is "five trillion, one billion, one hundred fourteen million, thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •