Base | Representation |
---|---|
bin | 111000010110101111… |
… | …0010101101011010000 |
3 | 102120101020021012112220 |
4 | 1300231132111223100 |
5 | 3440323113341422 |
6 | 131332521421040 |
7 | 11513016062361 |
oct | 1605536255320 |
9 | 376336235486 |
10 | 121022012112 |
11 | 47363852a31 |
12 | 1b55603a780 |
13 | b548b60771 |
14 | 5c00d83b68 |
15 | 3234a83e5c |
hex | 1c2d795ad0 |
121022012112 has 40 divisors (see below), whose sum is σ = 312656563104. Its totient is φ = 40338559104.
The previous prime is 121022012093. The next prime is 121022012179. The reversal of 121022012112 is 211210220121.
121022012112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 121022012091 and 121022012100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1057903 + ... + 1166705.
Almost surely, 2121022012112 is an apocalyptic number.
121022012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121022012112 is an abundant number, since it is smaller than the sum of its proper divisors (191634550992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121022012112 is a wasteful number, since it uses less digits than its factorization.
121022012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131987 (or 131981 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121022012112 its reverse (211210220121), we get a palindrome (332232232233).
The spelling of 121022012112 in words is "one hundred twenty-one billion, twenty-two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •