Base | Representation |
---|---|
bin | 1001011001001000… |
… | …10000011001001011 |
3 | 111000102200010121101 |
4 | 10230210100121023 |
5 | 40311410403011 |
6 | 2152213522231 |
7 | 235650660163 |
oct | 45444203113 |
9 | 14012603541 |
10 | 5042669131 |
11 | 2158500a55 |
12 | b88943377 |
13 | 62494b2b6 |
14 | 35ba0b5a3 |
15 | 1e7a842c1 |
hex | 12c91064b |
5042669131 has 2 divisors, whose sum is σ = 5042669132. Its totient is φ = 5042669130.
The previous prime is 5042669113. The next prime is 5042669197. The reversal of 5042669131 is 1319662405.
Together with previous prime (5042669113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5042669131 - 27 = 5042669003 is a prime.
It is a super-2 number, since 2×50426691312 = 50857023929480590322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5042669101) 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, 2521334565 + 2521334566.
It is an arithmetic number, because the mean of its divisors is an integer number (2521334566).
Almost surely, 25042669131 is an apocalyptic number.
5042669131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5042669131 is an equidigital number, since it uses as much as digits as its factorization.
5042669131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 37.
The square root of 5042669131 is about 71011.7534708164. The cubic root of 5042669131 is about 1714.8263876365.
The spelling of 5042669131 in words is "five billion, forty-two million, six hundred sixty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •