Base | Representation |
---|---|
bin | 11011100010011000100100… |
… | …100111110010010100100000 |
3 | 120212211000100020221212011201 |
4 | 123202120210213302110200 |
5 | 111333231442132101422 |
6 | 1105325113552050544 |
7 | 34336626143322253 |
oct | 3342304447622440 |
9 | 525730306855151 |
10 | 121110102222112 |
11 | 356535624091a3 |
12 | 116bbb48233a54 |
13 | 5276831133463 |
14 | 21c9a900a909a |
15 | e00541e57727 |
hex | 6e26249f2520 |
121110102222112 has 24 divisors (see below), whose sum is σ = 238435923782700. Its totient is φ = 60554946975744.
The previous prime is 121110102222077. The next prime is 121110102222143. The reversal of 121110102222112 is 211222201011121.
It is a happy number.
121110102222112 is digitally balanced in base 3, 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 110514842860816 + 10595259361296 = 10512604^2 + 3255036^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 121110102222112.
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, 17725464 + ... + 23588392.
Almost surely, 2121110102222112 is an apocalyptic number.
It is an amenable number.
121110102222112 is a deficient number, since it is larger than the sum of its proper divisors (117325821560588).
121110102222112 is an equidigital number, since it uses as much as digits as its factorization.
121110102222112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6508468 (or 6508460 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121110102222112 its reverse (211222201011121), we get a palindrome (332332303233233).
The spelling of 121110102222112 in words is "one hundred twenty-one trillion, one hundred ten billion, one hundred two million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •