Base | Representation |
---|---|
bin | 11011100010011001100111… |
… | …010011101000001010101000 |
3 | 120212211010020020011020011100 |
4 | 123202121213103220022220 |
5 | 111333241240034323422 |
6 | 1105325420555401400 |
7 | 34336665650011623 |
oct | 3342314723501250 |
9 | 525733206136140 |
10 | 121111221011112 |
11 | 35653a86996a02 |
12 | 117001baa53260 |
13 | 527697bb62297 |
14 | 21c9b588d8dba |
15 | e005aa2a07ac |
hex | 6e26674e82a8 |
121111221011112 has 96 divisors (see below), whose sum is σ = 331453813977000. Its totient is φ = 39947471861760.
The previous prime is 121111221011071. The next prime is 121111221011167. The reversal of 121111221011112 is 211110122111121.
It can be written as a sum of positive squares in 4 ways, for example, as 32130599844996 + 88980621166116 = 5668386^2 + 9432954^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4167037 + ... + 16111692.
Almost surely, 2121111221011112 is an apocalyptic number.
121111221011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121111221011112 is an abundant number, since it is smaller than the sum of its proper divisors (210342592965888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121111221011112 is a wasteful number, since it uses less digits than its factorization.
121111221011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20279611 (or 20279604 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 18.
Adding to 121111221011112 its reverse (211110122111121), we get a palindrome (332221343122233).
The spelling of 121111221011112 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred twenty-one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •