Base | Representation |
---|---|
bin | 11001010010001011001011… |
… | …110010000110100000001010 |
3 | 112120201121221201012101220001 |
4 | 121102023023302012200022 |
5 | 104033400322240431442 |
6 | 1032300344135353214 |
7 | 32264641456105162 |
oct | 3122131362064012 |
9 | 476647851171801 |
10 | 111200122202122 |
11 | 32482786002578 |
12 | 1057b3b3b2280a |
13 | 4a08184ca44c5 |
14 | 1d661867995a2 |
15 | ccc884edb2b7 |
hex | 6522cbc8680a |
111200122202122 has 8 divisors (see below), whose sum is σ = 175579140319200. Its totient is φ = 52673742095724.
The previous prime is 111200122202101. The next prime is 111200122202161. The reversal of 111200122202122 is 221202221002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 111200122202122.
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 3 ways as a sum of consecutive naturals, for example, 1463159502622 + ... + 1463159502697.
It is an arithmetic number, because the mean of its divisors is an integer number (21947392539900).
Almost surely, 2111200122202122 is an apocalyptic number.
111200122202122 is a deficient number, since it is larger than the sum of its proper divisors (64379018117078).
111200122202122 is a wasteful number, since it uses less digits than its factorization.
111200122202122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2926319005340.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 111200122202122 its reverse (221202221002111), we get a palindrome (332402343204233).
The spelling of 111200122202122 in words is "one hundred eleven trillion, two hundred billion, one hundred twenty-two million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •