Base | Representation |
---|---|
bin | 10100101101000001… |
… | …00011010000101111 |
3 | 1001200121221001012200 |
4 | 22112200203100233 |
5 | 140230423100111 |
6 | 5034534032543 |
7 | 542304236451 |
oct | 122640432057 |
9 | 31617831180 |
10 | 11115050031 |
11 | 4794179668 |
12 | 21a24a8753 |
13 | 1081a0a4a7 |
14 | 77629c2d1 |
15 | 450c18256 |
hex | 29682342f |
11115050031 has 24 divisors (see below), whose sum is σ = 16578372096. Its totient is φ = 7168666320.
The previous prime is 11115050003. The next prime is 11115050047. The reversal of 11115050031 is 13005051111.
11115050031 is a `hidden beast` number, since 1 + 11 + 150 + 500 + 3 + 1 = 666.
It is not a de Polignac number, because 11115050031 - 214 = 11115033647 is a prime.
It is a super-2 number, since 2×111150500312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11115049986 and 11115050013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110050031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1391856 + ... + 1399818.
It is an arithmetic number, because the mean of its divisors is an integer number (690765504).
Almost surely, 211115050031 is an apocalyptic number.
11115050031 is a deficient number, since it is larger than the sum of its proper divisors (5463322065).
11115050031 is a wasteful number, since it uses less digits than its factorization.
11115050031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13003 (or 13000 counting only the distinct ones).
The product of its (nonzero) digits is 75, while the sum is 18.
The spelling of 11115050031 in words is "eleven billion, one hundred fifteen million, fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.490 sec. • engine limits •