Base | Representation |
---|---|
bin | 111111000100000… |
… | …0000101100101111 |
3 | 12110110200102102000 |
4 | 1332020000230233 |
5 | 13313200413411 |
6 | 545545503343 |
7 | 103302644301 |
oct | 17610005457 |
9 | 5413612360 |
10 | 2116029231 |
11 | 996497098 |
12 | 4b07a1b53 |
13 | 279510b04 |
14 | 16105d971 |
15 | c5b81956 |
hex | 7e200b2f |
2116029231 has 16 divisors (see below), whose sum is σ = 3139029600. Its totient is φ = 1408809024.
The previous prime is 2116029199. The next prime is 2116029247. The reversal of 2116029231 is 1329206112.
2116029231 is a `hidden beast` number, since 21 + 1 + 602 + 9 + 2 + 31 = 666.
It is not a de Polignac number, because 2116029231 - 25 = 2116029199 is a prime.
It is a super-2 number, since 2×21160292312 = 8955159412892902722, 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 = 2116029195 and 2116029204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2116029271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31326 + ... + 72203.
It is an arithmetic number, because the mean of its divisors is an integer number (196189350).
Almost surely, 22116029231 is an apocalyptic number.
2116029231 is a deficient number, since it is larger than the sum of its proper divisors (1023000369).
2116029231 is a wasteful number, since it uses less digits than its factorization.
2116029231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104295 (or 104289 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 2116029231 is about 46000.3177271636. The cubic root of 2116029231 is about 1283.8291162664.
The spelling of 2116029231 in words is "two billion, one hundred sixteen million, twenty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •