Base | Representation |
---|---|
bin | 101101101110100100010101… |
… | …010111000011011101011110 |
3 | 222101002010202010220122212022 |
4 | 231232210111113003131132 |
5 | 202330010242203001342 |
6 | 1551421400430140142 |
7 | 60234606563323652 |
oct | 5556442527033536 |
9 | 871063663818768 |
10 | 201112202000222 |
11 | 5909822a054747 |
12 | 1a680a85651652 |
13 | 882aa51006516 |
14 | 3793c4d88ca62 |
15 | 183b5cadb29d2 |
hex | b6e9155c375e |
201112202000222 has 8 divisors (see below), whose sum is σ = 309026066488272. Its totient is φ = 98103513170800.
The previous prime is 201112202000167. The next prime is 201112202000239. The reversal of 201112202000222 is 222000202211102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2011122020002222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201112202000222.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1226293914554 + ... + 1226293914717.
It is an arithmetic number, because the mean of its divisors is an integer number (38628258311034).
Almost surely, 2201112202000222 is an apocalyptic number.
201112202000222 is a deficient number, since it is larger than the sum of its proper divisors (107913864488050).
201112202000222 is a wasteful number, since it uses less digits than its factorization.
201112202000222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2452587829314.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 201112202000222 its reverse (222000202211102), we get a palindrome (423112404211324).
The spelling of 201112202000222 in words is "two hundred one trillion, one hundred twelve billion, two hundred two million, two hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •