Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1101001101000011011010 |
3 | 1110022011120212121220211122 |
4 | 2201201320031031003122 |
5 | 2423331213312020442 |
6 | 35335211143125242 |
7 | 2223651415043354 |
oct | 241417015150332 |
9 | 43264525556748 |
10 | 11100212220122 |
11 | 359a634464143 |
12 | 12b3366743822 |
13 | 62698cba901c |
14 | 2a537887a0d4 |
15 | 143b1e363dd2 |
hex | a187834d0da |
11100212220122 has 32 divisors (see below), whose sum is σ = 17466648209280. Its totient is φ = 5280570408960.
The previous prime is 11100212220121. The next prime is 11100212220133. The reversal of 11100212220122 is 22102221200111.
It is a super-3 number, since 3×111002122201223 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 11100212220122.
It is not an unprimeable number, because it can be changed into a prime (11100212220121) by changing a digit.
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, 68110529 + ... + 68273307.
It is an arithmetic number, because the mean of its divisors is an integer number (545832756540).
Almost surely, 211100212220122 is an apocalyptic number.
11100212220122 is a deficient number, since it is larger than the sum of its proper divisors (6366435989158).
11100212220122 is a wasteful number, since it uses less digits than its factorization.
11100212220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170678.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11100212220122 its reverse (22102221200111), we get a palindrome (33202433420233).
The spelling of 11100212220122 in words is "eleven trillion, one hundred billion, two hundred twelve million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •