Base | Representation |
---|---|
bin | 1010111010100011010010… |
… | …0010100110100100010010 |
3 | 1120111021201201121010011212 |
4 | 2232220310202212210102 |
5 | 3033111042122023442 |
6 | 41305105330340122 |
7 | 2346021315554300 |
oct | 256506442464422 |
9 | 46437651533155 |
10 | 12001020111122 |
11 | 3907670a94449 |
12 | 1419a6542a642 |
13 | 6908cab4b933 |
14 | 2d6bd1283270 |
15 | 15c292775a82 |
hex | aea348a6912 |
12001020111122 has 12 divisors (see below), whose sum is σ = 20940555500190. Its totient is φ = 5143294333296.
The previous prime is 12001020111121. The next prime is 12001020111131. The reversal of 12001020111122 is 22111102010021.
It can be written as a sum of positive squares in only one way, i.e., 11495483469001 + 505536642121 = 3390499^2 + 711011^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 12001020111097 and 12001020111106.
It is not an unprimeable number, because it can be changed into a prime (12001020111121) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 61229694347 + ... + 61229694542.
Almost surely, 212001020111122 is an apocalyptic number.
12001020111122 is a deficient number, since it is larger than the sum of its proper divisors (8939535389068).
12001020111122 is a wasteful number, since it uses less digits than its factorization.
12001020111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122459388905 (or 122459388898 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12001020111122 its reverse (22111102010021), we get a palindrome (34112122121143).
The spelling of 12001020111122 in words is "twelve trillion, one billion, twenty million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •