Base | Representation |
---|---|
bin | 101101011110011010100110… |
… | …000011101110011011101011 |
3 | 222020011000201111121021220020 |
4 | 231132122212003232123223 |
5 | 202203314033133200021 |
6 | 1545211431340331523 |
7 | 60061453532333256 |
oct | 5536324603563353 |
9 | 866130644537806 |
10 | 200002233100011 |
11 | 587aa51a5a0451 |
12 | 1a521933243ba3 |
13 | 877a18bb0c534 |
14 | 375623443a09d |
15 | 181c7b51487c6 |
hex | b5e6a60ee6eb |
200002233100011 has 16 divisors (see below), whose sum is σ = 270117550440960. Its totient is φ = 131611773178080.
The previous prime is 200002233099989. The next prime is 200002233100031. The reversal of 200002233100011 is 110001332200002.
It is not a de Polignac number, because 200002233100011 - 211 = 200002233097963 is a prime.
It is a super-2 number, since 2×2000022331000112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200002233100031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 112146525 + ... + 113915966.
It is an arithmetic number, because the mean of its divisors is an integer number (16882346902560).
Almost surely, 2200002233100011 is an apocalyptic number.
200002233100011 is a deficient number, since it is larger than the sum of its proper divisors (70115317340949).
200002233100011 is a wasteful number, since it uses less digits than its factorization.
200002233100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226066306.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 200002233100011 its reverse (110001332200002), we get a palindrome (310003565300013).
Subtracting from 200002233100011 its reverse (110001332200002), we obtain a palindrome (90000900900009).
The spelling of 200002233100011 in words is "two hundred trillion, two billion, two hundred thirty-three million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •