Base | Representation |
---|---|
bin | 11110101101001100010… |
… | …110111000111010000100 |
3 | 21110201120012020222002002 |
4 | 132231030112320322010 |
5 | 234033001130323022 |
6 | 4253212100404432 |
7 | 305310331104233 |
oct | 36551426707204 |
9 | 7421505228062 |
10 | 2110110011012 |
11 | 7439900aa893 |
12 | 2a0b536a6718 |
13 | 123ca079b643 |
14 | 741b650cb1a |
15 | 39d4eaa6092 |
hex | 1eb4c5b8e84 |
2110110011012 has 12 divisors (see below), whose sum is σ = 3692704530060. Its totient is φ = 1055051573856.
The previous prime is 2110110011011. The next prime is 2110110011057. The reversal of 2110110011012 is 2101100110112.
It can be written as a sum of positive squares in 2 ways, for example, as 1176691240516 + 933418770496 = 1084754^2 + 966136^2 .
It is a super-2 number, since 2×21101100110122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2110110010984 and 2110110011002.
It is not an unprimeable number, because it can be changed into a prime (2110110011011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 947978 + ... + 2262494.
It is an arithmetic number, because the mean of its divisors is an integer number (307725377505).
Almost surely, 22110110011012 is an apocalyptic number.
It is an amenable number.
2110110011012 is a deficient number, since it is larger than the sum of its proper divisors (1582594519048).
2110110011012 is a wasteful number, since it uses less digits than its factorization.
2110110011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1715830 (or 1715828 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2110110011012 its reverse (2101100110112), we get a palindrome (4211210121124).
The spelling of 2110110011012 in words is "two trillion, one hundred ten billion, one hundred ten million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •