Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …11110111101001000101000 |
3 | 2122012111222011220221212012 |
4 | 10210221011332331020220 |
5 | 10113441203004323422 |
6 | 110434300422335052 |
7 | 4143625530120035 |
oct | 444510576751050 |
9 | 78174864827765 |
10 | 20110211011112 |
11 | 64537689309a2 |
12 | 23095b0b8a488 |
13 | b2b500421a91 |
14 | 4d74a748c38c |
15 | 24d1a57604e2 |
hex | 124a45fbd228 |
20110211011112 has 16 divisors (see below), whose sum is σ = 37706871908340. Its totient is φ = 10055045168896.
The previous prime is 20110211011091. The next prime is 20110211011127. The reversal of 20110211011112 is 21111011201102.
20110211011112 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 20078877054916 + 31333956196 = 4480946^2 + 177014^2 .
It is a super-2 number, since 2×201102110111122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6109553 + ... + 8806080.
Almost surely, 220110211011112 is an apocalyptic number.
It is an amenable number.
20110211011112 is a deficient number, since it is larger than the sum of its proper divisors (17596660897228).
20110211011112 is a wasteful number, since it uses less digits than its factorization.
20110211011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15084172 (or 15084168 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 20110211011112 its reverse (21111011201102), we get a palindrome (41221222212214).
The spelling of 20110211011112 in words is "twenty trillion, one hundred ten billion, two hundred eleven million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •