Base | Representation |
---|---|
bin | 101101100001010100101111… |
… | …000111010011011000101011 |
3 | 222020212010121122100012201111 |
4 | 231201110233013103120223 |
5 | 202220102400324341021 |
6 | 1545443324151331151 |
7 | 60112060460502130 |
oct | 5541245707233053 |
9 | 866763548305644 |
10 | 200202101012011 |
11 | 58877263843a0a |
12 | 1a554612680ab7 |
13 | 8792c91961717 |
14 | 3761b94b76587 |
15 | 1822ab1bca8e1 |
hex | b6152f1d362b |
200202101012011 has 8 divisors (see below), whose sum is σ = 228803865834240. Its totient is φ = 171600702359208.
The previous prime is 200202101011987. The next prime is 200202101012033. The reversal of 200202101012011 is 110210101202002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200202101012011 - 219 = 200202100487723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200202101011982 and 200202101012000.
It is not an unprimeable number, because it can be changed into a prime (200202101012071) 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, 90369751 + ... + 92558608.
It is an arithmetic number, because the mean of its divisors is an integer number (28600483229280).
Almost surely, 2200202101012011 is an apocalyptic number.
200202101012011 is a deficient number, since it is larger than the sum of its proper divisors (28601764822229).
200202101012011 is a wasteful number, since it uses less digits than its factorization.
200202101012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183084713.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200202101012011 its reverse (110210101202002), we get a palindrome (310412202214013).
The spelling of 200202101012011 in words is "two hundred trillion, two hundred two billion, one hundred one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •