Base | Representation |
---|---|
bin | 11001010010011101101101… |
… | …001100000100100110000100 |
3 | 112120210112021201121202212111 |
4 | 121102131231030010212010 |
5 | 104034212040030323022 |
6 | 1032313433420230404 |
7 | 32266244346513250 |
oct | 3122355514044604 |
9 | 476715251552774 |
10 | 111220010011012 |
11 | 32490161173771 |
12 | 1058322439b404 |
13 | 4a0a00435a666 |
14 | 1d67111bd9260 |
15 | ccd14ae95477 |
hex | 65276d304984 |
111220010011012 has 24 divisors (see below), whose sum is σ = 222446297291904. Its totient is φ = 47664373446912.
The previous prime is 111220010011007. The next prime is 111220010011049. The reversal of 111220010011012 is 210110010022111.
It is a happy number.
It is a super-2 number, since 2×1112200100110122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111220010010983 and 111220010011001.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55036813 + ... + 57021844.
It is an arithmetic number, because the mean of its divisors is an integer number (9268595720496).
Almost surely, 2111220010011012 is an apocalyptic number.
It is an amenable number.
111220010011012 is an abundant number, since it is smaller than the sum of its proper divisors (111226287280892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111220010011012 is a wasteful number, since it uses less digits than its factorization.
111220010011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112094115 (or 112094113 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111220010011012 its reverse (210110010022111), we get a palindrome (321330020033123).
The spelling of 111220010011012 in words is "one hundred eleven trillion, two hundred twenty billion, ten million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •