Base | Representation |
---|---|
bin | 1001011110100010… |
… | …01110001100010111 |
3 | 111010120222202000000 |
4 | 10233101032030113 |
5 | 40410012323111 |
6 | 2200513422343 |
7 | 240041244255 |
oct | 45721161427 |
9 | 14116882000 |
10 | 5088011031 |
11 | 218105aaa4 |
12 | b9bb6a9b3 |
13 | 63116541c |
14 | 363a515d5 |
15 | 1eba3dc56 |
hex | 12f44e317 |
5088011031 has 14 divisors (see below), whose sum is σ = 7628527920. Its totient is φ = 3392006868.
The previous prime is 5088010973. The next prime is 5088011041. The reversal of 5088011031 is 1301108805.
It is not a de Polignac number, because 5088011031 - 217 = 5087879959 is a prime.
It is a super-2 number, since 2×50880110312 = 51775712503155365922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5088010986 and 5088011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5088011041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 3488991 + ... + 3490448.
Almost surely, 25088011031 is an apocalyptic number.
5088011031 is a deficient number, since it is larger than the sum of its proper divisors (2540516889).
5088011031 is an frugal number, since it uses more digits than its factorization.
5088011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6979457 (or 6979442 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 27.
The square root of 5088011031 is about 71330.2953239365. The cubic root of 5088011031 is about 1719.9507637564.
Adding to 5088011031 its reverse (1301108805), we get a palindrome (6389119836).
The spelling of 5088011031 in words is "five billion, eighty-eight million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •