Base | Representation |
---|---|
bin | 101101011111110111101101… |
… | …001101100010001000011011 |
3 | 222020111120210010211222110120 |
4 | 231133313231031202020123 |
5 | 202211433312020214321 |
6 | 1545325404200044323 |
7 | 60101623221326316 |
oct | 5537675515421033 |
9 | 866446703758416 |
10 | 200102211101211 |
11 | 58838964570521 |
12 | 1a5391957636a3 |
13 | 8786732bb8b23 |
14 | 375adda5b197d |
15 | 18201b7489ec6 |
hex | b5fded36221b |
200102211101211 has 8 divisors (see below), whose sum is σ = 266803075003200. Its totient is φ = 133401410633352.
The previous prime is 200102211101189. The next prime is 200102211101231. The reversal of 200102211101211 is 112101112201002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200102211101211 - 25 = 200102211101179 is a prime.
It is a super-2 number, since 2×2001022111012112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200102211101231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7932085 + ... + 21520278.
It is an arithmetic number, because the mean of its divisors is an integer number (33350384375400).
Almost surely, 2200102211101211 is an apocalyptic number.
200102211101211 is a deficient number, since it is larger than the sum of its proper divisors (66700863901989).
200102211101211 is a wasteful number, since it uses less digits than its factorization.
200102211101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31717065.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 200102211101211 its reverse (112101112201002), we get a palindrome (312203323302213).
The spelling of 200102211101211 in words is "two hundred trillion, one hundred two billion, two hundred eleven million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •