Base | Representation |
---|---|
bin | 1001011001011110… |
… | …00101000000001001 |
3 | 111000122000021010201 |
4 | 10230233011000021 |
5 | 40313122143212 |
6 | 2152354412201 |
7 | 236014044124 |
oct | 45457050011 |
9 | 14018007121 |
10 | 5045506057 |
11 | 215a069419 |
12 | b89891061 |
13 | 625402657 |
14 | 35c1493bb |
15 | 1e7e44b57 |
hex | 12cbc5009 |
5045506057 has 2 divisors, whose sum is σ = 5045506058. Its totient is φ = 5045506056.
The previous prime is 5045506049. The next prime is 5045506079. The reversal of 5045506057 is 7506055405.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4820386041 + 225120016 = 69429^2 + 15004^2 .
It is a cyclic number.
It is not a de Polignac number, because 5045506057 - 23 = 5045506049 is a prime.
It is not a weakly prime, because it can be changed into another prime (5045506357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2522753028 + 2522753029.
It is an arithmetic number, because the mean of its divisors is an integer number (2522753029).
Almost surely, 25045506057 is an apocalyptic number.
It is an amenable number.
5045506057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5045506057 is an equidigital number, since it uses as much as digits as its factorization.
5045506057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105000, while the sum is 37.
The square root of 5045506057 is about 71031.7257076020. The cubic root of 5045506057 is about 1715.1479054300.
The spelling of 5045506057 in words is "five billion, forty-five million, five hundred six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •