Base | Representation |
---|---|
bin | 11001010010001011000101… |
… | …110011110111100101010000 |
3 | 112120201121200201122201011102 |
4 | 121102023011303313211100 |
5 | 104033400121113031000 |
6 | 1032300330200003532 |
7 | 32264636131320431 |
oct | 3122130563674520 |
9 | 476647621581142 |
10 | 111200022002000 |
11 | 32482734494758 |
12 | 1057b3864605a8 |
13 | 4a0816a2c08a9 |
14 | 1d66177355488 |
15 | ccc87b2e73d5 |
hex | 6522c5cf7950 |
111200022002000 has 80 divisors (see below), whose sum is σ = 268927636321344. Its totient is φ = 44472402000000.
The previous prime is 111200022001963. The next prime is 111200022002023. The reversal of 111200022002000 is 200220002111.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
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, 6950675 + ... + 16453325.
Almost surely, 2111200022002000 is an apocalyptic number.
111200022002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111200022002000 is an abundant number, since it is smaller than the sum of its proper divisors (157727614319344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111200022002000 is an equidigital number, since it uses as much as digits as its factorization.
111200022002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9508525 (or 9508509 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 111200022002000 its reverse (200220002111), we get a palindrome (111400242004111).
The spelling of 111200022002000 in words is "one hundred eleven trillion, two hundred billion, twenty-two million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •