Base | Representation |
---|---|
bin | 1001010111100100… |
… | …11100011001111011 |
3 | 110222112002201101202 |
4 | 10223302130121323 |
5 | 40300040024011 |
6 | 2151030004415 |
7 | 235431663206 |
oct | 45362343173 |
9 | 13875081352 |
10 | 5029611131 |
11 | 21510a2316 |
12 | b844a670b |
13 | 62202887c |
14 | 359dac93d |
15 | 1e685523b |
hex | 12bc9c67b |
5029611131 has 2 divisors, whose sum is σ = 5029611132. Its totient is φ = 5029611130.
The previous prime is 5029611127. The next prime is 5029611149. The reversal of 5029611131 is 1311169205.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5029611131 - 22 = 5029611127 is a prime.
It is a super-2 number, since 2×50296111312 = 50593976258158198322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5029611094 and 5029611103.
It is not a weakly prime, because it can be changed into another prime (5029611121) 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, 2514805565 + 2514805566.
It is an arithmetic number, because the mean of its divisors is an integer number (2514805566).
Almost surely, 25029611131 is an apocalyptic number.
5029611131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5029611131 is an equidigital number, since it uses as much as digits as its factorization.
5029611131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 29.
The square root of 5029611131 is about 70919.7513461518. The cubic root of 5029611131 is about 1713.3449262347.
The spelling of 5029611131 in words is "five billion, twenty-nine million, six hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •