Base | Representation |
---|---|
bin | 10000010100111101100… |
… | …110101101011011111100 |
3 | 10222021010111121210020120 |
4 | 100110331212231123330 |
5 | 121340344111201022 |
6 | 2215240543014540 |
7 | 144030462553311 |
oct | 20247546553374 |
9 | 3867114553216 |
10 | 1122020022012 |
11 | 3a293406249a |
12 | 16155629a450 |
13 | 81a62b1a6b6 |
14 | 3c43db7ad08 |
15 | 1e2bdc36d5c |
hex | 1053d9ad6fc |
1122020022012 has 48 divisors (see below), whose sum is σ = 2680185416832. Its totient is φ = 365137859520.
The previous prime is 1122020021987. The next prime is 1122020022157. The reversal of 1122020022012 is 2102200202211.
It is a junction number, because it is equal to n+sod(n) for n = 1122020021982 and 1122020022000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 596943 + ... + 1612569.
It is an arithmetic number, because the mean of its divisors is an integer number (55837196184).
Almost surely, 21122020022012 is an apocalyptic number.
1122020022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1122020022012 is an abundant number, since it is smaller than the sum of its proper divisors (1558165394820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122020022012 is a wasteful number, since it uses less digits than its factorization.
1122020022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017818 (or 1017816 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1122020022012 its reverse (2102200202211), we get a palindrome (3224220224223).
The spelling of 1122020022012 in words is "one trillion, one hundred twenty-two billion, twenty million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •