Base | Representation |
---|---|
bin | 101101011110101011001010… |
… | …010000001111011101111011 |
3 | 222020012201122010020010011211 |
4 | 231132223022100033131323 |
5 | 202204112000134330021 |
6 | 1545223532340303551 |
7 | 60062653364416162 |
oct | 5536531220173573 |
9 | 866181563203154 |
10 | 200020020230011 |
11 | 588070179aa493 |
12 | 1a5252780a1bb7 |
13 | 877ba64bca827 |
14 | 37570408943d9 |
15 | 181cea69a43e1 |
hex | b5eaca40f77b |
200020020230011 has 4 divisors (see below), whose sum is σ = 205425966722752. Its totient is φ = 194614073737272.
The previous prime is 200020020229993. The next prime is 200020020230033. The reversal of 200020020230011 is 110032020020002.
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 200020020230011 - 245 = 164835648141179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200020020229973 and 200020020230000.
It is not an unprimeable number, because it can be changed into a prime (200020020230411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2702973246315 + ... + 2702973246388.
It is an arithmetic number, because the mean of its divisors is an integer number (51356491680688).
Almost surely, 2200020020230011 is an apocalyptic number.
200020020230011 is a deficient number, since it is larger than the sum of its proper divisors (5405946492741).
200020020230011 is an equidigital number, since it uses as much as digits as its factorization.
200020020230011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5405946492740.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 200020020230011 its reverse (110032020020002), we get a palindrome (310052040250013).
The spelling of 200020020230011 in words is "two hundred trillion, twenty billion, twenty million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •