Base | Representation |
---|---|
bin | 11001010010001011000100… |
… | …101000010101100110100100 |
3 | 112120201121122100101202200211 |
4 | 121102023010220111212210 |
5 | 104033400101030431040 |
6 | 1032300324211345204 |
7 | 32264635501113514 |
oct | 3122130450254644 |
9 | 476647570352624 |
10 | 111200002202020 |
11 | 324827242a0736 |
12 | 1057b37b8b2204 |
13 | 4a0816617a524 |
14 | 1d6617487d844 |
15 | ccc8796d58ea |
hex | 6522c4a159a4 |
111200002202020 has 48 divisors (see below), whose sum is σ = 239101597163520. Its totient is φ = 43421706126464.
The previous prime is 111200002201997. The next prime is 111200002202041. The reversal of 111200002202020 is 20202200002111.
It is a happy 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 15 ways as a sum of consecutive naturals, for example, 151688164 + ... + 152419483.
It is an arithmetic number, because the mean of its divisors is an integer number (4981283274240).
Almost surely, 2111200002202020 is an apocalyptic number.
111200002202020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111200002202020 is an abundant number, since it is smaller than the sum of its proper divisors (127901594961500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111200002202020 is a wasteful number, since it uses less digits than its factorization.
111200002202020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304108092 (or 304108090 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 111200002202020 its reverse (20202200002111), we get a palindrome (131402202204131).
The spelling of 111200002202020 in words is "one hundred eleven trillion, two hundred billion, two million, two hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •