Base | Representation |
---|---|
bin | 11110101110001000100… |
… | …100000111010110100100 |
3 | 21110211011120221100210012 |
4 | 132232020210013112210 |
5 | 234042033222023022 |
6 | 4253500222345352 |
7 | 305344344602213 |
oct | 36561044072644 |
9 | 7424146840705 |
10 | 2111120111012 |
11 | 7443592a1980 |
12 | 2a1195a2b258 |
13 | 124101b33a53 |
14 | 7427072907a |
15 | 39dad5cede2 |
hex | 1eb889075a4 |
2111120111012 has 12 divisors (see below), whose sum is σ = 4030320212016. Its totient is φ = 959600050440.
The previous prime is 2111120111011. The next prime is 2111120111021. The reversal of 2111120111012 is 2101110211112.
It is a super-3 number, since 3×21111201110123 (a number of 38 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (2111120111011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23990001218 + ... + 23990001305.
It is an arithmetic number, because the mean of its divisors is an integer number (335860017668).
Almost surely, 22111120111012 is an apocalyptic number.
2111120111012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2111120111012 is a deficient number, since it is larger than the sum of its proper divisors (1919200101004).
2111120111012 is a wasteful number, since it uses less digits than its factorization.
2111120111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47980002538 (or 47980002536 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 2111120111012 its reverse (2101110211112), we get a palindrome (4212230322124).
The spelling of 2111120111012 in words is "two trillion, one hundred eleven billion, one hundred twenty million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •