Base | Representation |
---|---|
bin | 10000001011110100011… |
… | …010101100010010011100 |
3 | 10221022210021122202122020 |
4 | 100023310122230102130 |
5 | 121210242230401340 |
6 | 2210534425020140 |
7 | 143232256501206 |
oct | 20136432542234 |
9 | 3838707582566 |
10 | 1112202200220 |
11 | 399756168691 |
12 | 15b676324650 |
13 | 80b59ab76a7 |
14 | 3bb8bcbb776 |
15 | 1dde6d629d0 |
hex | 102f46ac49c |
1112202200220 has 96 divisors (see below), whose sum is σ = 3130611724800. Its totient is φ = 295021774080.
The previous prime is 1112202200173. The next prime is 1112202200237. The reversal of 1112202200220 is 220022022111.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1112202200220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 59368255 + ... + 59386985.
It is an arithmetic number, because the mean of its divisors is an integer number (32610538800).
Almost surely, 21112202200220 is an apocalyptic number.
1112202200220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112202200220 is an abundant number, since it is smaller than the sum of its proper divisors (2018409524580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112202200220 is a wasteful number, since it uses less digits than its factorization.
1112202200220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23915 (or 23913 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1112202200220 its reverse (220022022111), we get a palindrome (1332224222331).
The spelling of 1112202200220 in words is "one trillion, one hundred twelve billion, two hundred two million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •