Base | Representation |
---|---|
bin | 1001100001010010… |
… | …10000011100101001 |
3 | 111012012102012221021 |
4 | 10300221100130221 |
5 | 40431414321222 |
6 | 2203100212441 |
7 | 240441352633 |
oct | 46051203451 |
9 | 14165365837 |
10 | 5111088937 |
11 | 2193092849 |
12 | ba783a121 |
13 | 635b857a6 |
14 | 366b3ba53 |
15 | 1eda9bac7 |
hex | 130a50729 |
5111088937 has 2 divisors, whose sum is σ = 5111088938. Its totient is φ = 5111088936.
The previous prime is 5111088929. The next prime is 5111088959. The reversal of 5111088937 is 7398801115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4311104281 + 799984656 = 65659^2 + 28284^2 .
It is a cyclic number.
It is not a de Polignac number, because 5111088937 - 23 = 5111088929 is a prime.
It is a super-2 number, since 2×51110889372 = 52246460243847579938, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5111088893 and 5111088902.
It is not a weakly prime, because it can be changed into another prime (5111088907) 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, 2555544468 + 2555544469.
It is an arithmetic number, because the mean of its divisors is an integer number (2555544469).
Almost surely, 25111088937 is an apocalyptic number.
It is an amenable number.
5111088937 is a deficient number, since it is larger than the sum of its proper divisors (1).
5111088937 is an equidigital number, since it uses as much as digits as its factorization.
5111088937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 43.
The square root of 5111088937 is about 71491.8802172666. The cubic root of 5111088937 is about 1722.5472597402.
The spelling of 5111088937 in words is "five billion, one hundred eleven million, eighty-eight thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •