Base | Representation |
---|---|
bin | 101101100000001010010000… |
… | …000000010110011110110011 |
3 | 222020120111011210002122120022 |
4 | 231200022100000112132303 |
5 | 202212300101240413021 |
6 | 1545342500032034055 |
7 | 60103226514021053 |
oct | 5540122000263663 |
9 | 866514153078508 |
10 | 200122122201011 |
11 | 5884635189a4aa |
12 | 1a54101199292b |
13 | 878858703829a |
14 | 375bd68b55563 |
15 | 18209804e51ab |
hex | b602900167b3 |
200122122201011 has 4 divisors (see below), whose sum is σ = 201561849699000. Its totient is φ = 198682394703024.
The previous prime is 200122122200989. The next prime is 200122122201091. The reversal of 200122122201011 is 110102221221002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200122122201011 - 226 = 200122055092147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200122122201091) 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 3 ways as a sum of consecutive naturals, for example, 719863748786 + ... + 719863749063.
It is an arithmetic number, because the mean of its divisors is an integer number (50390462424750).
Almost surely, 2200122122201011 is an apocalyptic number.
200122122201011 is a deficient number, since it is larger than the sum of its proper divisors (1439727497989).
200122122201011 is a wasteful number, since it uses less digits than its factorization.
200122122201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1439727497988.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200122122201011 its reverse (110102221221002), we get a palindrome (310224343422013).
The spelling of 200122122201011 in words is "two hundred trillion, one hundred twenty-two billion, one hundred twenty-two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •