Base | Representation |
---|---|
bin | 11001010010001100001101… |
… | …001101111100111101101010 |
3 | 112120201201210012221102211001 |
4 | 121102030031031330331222 |
5 | 104033410044311201442 |
6 | 1032301045113425214 |
7 | 32265010616321446 |
oct | 3122141515747552 |
9 | 476651705842731 |
10 | 111201220022122 |
11 | 32483199768a2a |
12 | 1057b65b70b20a |
13 | 4a082cb570b39 |
14 | 1d6624c4cb826 |
15 | ccc8eb5912b7 |
hex | 65230d37cf6a |
111201220022122 has 32 divisors (see below), whose sum is σ = 179635140633600. Its totient is φ = 51461963338608.
The previous prime is 111201220022107. The next prime is 111201220022143. The reversal of 111201220022122 is 221220022102111.
It is a super-2 number, since 2×1112012200221222 (a number of 29 digits) contains 22 as substring.
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 111201220022122.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54289972 + ... + 56301007.
It is an arithmetic number, because the mean of its divisors is an integer number (5613598144800).
Almost surely, 2111201220022122 is an apocalyptic number.
111201220022122 is a deficient number, since it is larger than the sum of its proper divisors (68433920611478).
111201220022122 is a wasteful number, since it uses less digits than its factorization.
111201220022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110591610.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 111201220022122 its reverse (221220022102111), we get a palindrome (332421242124233).
The spelling of 111201220022122 in words is "one hundred eleven trillion, two hundred one billion, two hundred twenty million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •