Base | Representation |
---|---|
bin | 1010000111010001101000… |
… | …1101100101111011110100 |
3 | 1110101001221120222221220111 |
4 | 2201310122031211323310 |
5 | 2424142441141201322 |
6 | 35352301423512404 |
7 | 2225254460165521 |
oct | 241643215457364 |
9 | 43331846887814 |
10 | 11120110100212 |
11 | 35a8015283a43 |
12 | 12b719a458704 |
13 | 62881137a279 |
14 | 2a630537c148 |
15 | 1443d615c177 |
hex | a1d1a365ef4 |
11120110100212 has 6 divisors (see below), whose sum is σ = 19460192675378. Its totient is φ = 5560055050104.
The previous prime is 11120110100189. The next prime is 11120110100261. The reversal of 11120110100212 is 21200101102111.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 6284878525156 + 4835231575056 = 2506966^2 + 2198916^2 .
It is a super-3 number, since 3×111201101002123 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11120110100192 and 11120110100201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1390013762523 + ... + 1390013762530.
Almost surely, 211120110100212 is an apocalyptic number.
It is an amenable number.
11120110100212 is a deficient number, since it is larger than the sum of its proper divisors (8340082575166).
11120110100212 is a wasteful number, since it uses less digits than its factorization.
11120110100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2780027525057 (or 2780027525055 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11120110100212 its reverse (21200101102111), we get a palindrome (32320211202323).
The spelling of 11120110100212 in words is "eleven trillion, one hundred twenty billion, one hundred ten million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •