Base | Representation |
---|---|
bin | 101101111101000110101001… |
… | …100101000011100010100010 |
3 | 222111121122010112110020100200 |
4 | 231331012221211003202202 |
5 | 202442342034001024302 |
6 | 1553504322305330030 |
7 | 60400021664554032 |
oct | 5575065145034242 |
9 | 874548115406320 |
10 | 202111121111202 |
11 | 59442932928726 |
12 | 1a8025a5636916 |
13 | 88a0cc6382c54 |
14 | 37ca33252d8c2 |
15 | 18575927ba81c |
hex | b7d1a99438a2 |
202111121111202 has 96 divisors (see below), whose sum is σ = 447175120824432. Its totient is φ = 65958229850112.
The previous prime is 202111121111147. The next prime is 202111121111243.
It is a happy number.
202111121111202 is a `hidden beast` number, since 20 + 211 + 1 + 121 + 111 + 202 = 666.
202111121111202 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 8 ways, for example, as 39900559922721 + 162210561188481 = 6316689^2 + 12736191^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
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 47 ways as a sum of consecutive naturals, for example, 4075042668 + ... + 4075092264.
Almost surely, 2202111121111202 is an apocalyptic number.
202111121111202 is an abundant number, since it is smaller than the sum of its proper divisors (245063999713230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202111121111202 is a wasteful number, since it uses less digits than its factorization.
202111121111202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72452 (or 72449 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
The spelling of 202111121111202 in words is "two hundred two trillion, one hundred eleven billion, one hundred twenty-one million, one hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •