Base | Representation |
---|---|
bin | 101101011111110111100000… |
… | …101000101101010010110011 |
3 | 222020111120020102212002001002 |
4 | 231133313200220231102303 |
5 | 202211432344012333021 |
6 | 1545325331222032215 |
7 | 60101615050120562 |
oct | 5537674050552263 |
9 | 866446212762032 |
10 | 200102000121011 |
11 | 58838866468a1a |
12 | 1a539136b7866b |
13 | 87866cb288a81 |
14 | 375adba571bd9 |
15 | 18201a3bb250b |
hex | b5fde0a2d4b3 |
200102000121011 has 8 divisors (see below), whose sum is σ = 200152838172240. Its totient is φ = 200051168426208.
The previous prime is 200102000120987. The next prime is 200102000121013. The reversal of 200102000121011 is 110121000201002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200102000121011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200102000120983 and 200102000121001.
It is not an unprimeable number, because it can be changed into a prime (200102000121013) 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, 61699145 + ... + 64861301.
It is an arithmetic number, because the mean of its divisors is an integer number (25019104771530).
Almost surely, 2200102000121011 is an apocalyptic number.
200102000121011 is a deficient number, since it is larger than the sum of its proper divisors (50838051229).
200102000121011 is an equidigital number, since it uses as much as digits as its factorization.
200102000121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3178213.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200102000121011 its reverse (110121000201002), we get a palindrome (310223000322013).
The spelling of 200102000121011 in words is "two hundred trillion, one hundred two billion, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •