Base | Representation |
---|---|
bin | 100100101101110111001… |
… | …0110110100100000001011 |
3 | 122212102100122222111000102 |
4 | 1021123232112310200023 |
5 | 1130134300341041011 |
6 | 14422122304000015 |
7 | 1030403533034024 |
oct | 111335626644013 |
9 | 18772318874012 |
10 | 5046290565131 |
11 | 1676135516262 |
12 | 69600860000b |
13 | 2a7b2b488aca |
14 | 13635559bc4b |
15 | 8b3eb5d973b |
hex | 496ee5b480b |
5046290565131 has 2 divisors, whose sum is σ = 5046290565132. Its totient is φ = 5046290565130.
The previous prime is 5046290565047. The next prime is 5046290565161. The reversal of 5046290565131 is 1315650926405.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5046290565131 - 230 = 5045216823307 is a prime.
It is a super-2 number, since 2×50462905651312 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5046290565161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2523145282565 + 2523145282566.
It is an arithmetic number, because the mean of its divisors is an integer number (2523145282566).
Almost surely, 25046290565131 is an apocalyptic number.
5046290565131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5046290565131 is an equidigital number, since it uses as much as digits as its factorization.
5046290565131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 47.
The spelling of 5046290565131 in words is "five trillion, forty-six billion, two hundred ninety million, five hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •