Base | Representation |
---|---|
bin | 101101100000000000000000… |
… | …010110010011001110000010 |
3 | 222020112102210011110200022022 |
4 | 231200000000112103032002 |
5 | 202212110034224213442 |
6 | 1545333440321441442 |
7 | 60102360103511021 |
oct | 5540000026231602 |
9 | 866472704420268 |
10 | 200111122101122 |
11 | 588417175a3661 |
12 | 1a53aa61aa0282 |
13 | 87875230a733b |
14 | 375b603c5a8b8 |
15 | 18205399363d2 |
hex | b60000593382 |
200111122101122 has 8 divisors (see below), whose sum is σ = 313217408506176. Its totient is φ = 95705319265732.
The previous prime is 200111122101049. The next prime is 200111122101127. The reversal of 200111122101122 is 221101221111002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2001111221011222 (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 200111122101122.
It is not an unprimeable number, because it can be changed into a prime (200111122101127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2175120892358 + ... + 2175120892449.
It is an arithmetic number, because the mean of its divisors is an integer number (39152176063272).
Almost surely, 2200111122101122 is an apocalyptic number.
200111122101122 is a deficient number, since it is larger than the sum of its proper divisors (113106286405054).
200111122101122 is a wasteful number, since it uses less digits than its factorization.
200111122101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4350241784832.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 200111122101122 its reverse (221101221111002), we get a palindrome (421212343212124).
The spelling of 200111122101122 in words is "two hundred trillion, one hundred eleven billion, one hundred twenty-two million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •