Base | Representation |
---|---|
bin | 101101011110011010011001… |
… | …010111100100111001001011 |
3 | 222020011000011122222212000001 |
4 | 231132122121113210321023 |
5 | 202203313114132400021 |
6 | 1545211354253223431 |
7 | 60061445335610461 |
oct | 5536323127447113 |
9 | 866130148885001 |
10 | 200002020200011 |
11 | 587aa4203a7537 |
12 | 1a521893a91b77 |
13 | 877a1569896c3 |
14 | 375621405a831 |
15 | 181c7a15e2091 |
hex | b5e6995e4e4b |
200002020200011 has 8 divisors (see below), whose sum is σ = 201580338544640. Its totient is φ = 198423756532008.
The previous prime is 200002020199997. The next prime is 200002020200023. The reversal of 200002020200011 is 110002020200002.
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 200002020200011 - 211 = 200002020197963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200002020200711) 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, 6308901 + ... + 20971558.
It is an arithmetic number, because the mean of its divisors is an integer number (25197542318080).
Almost surely, 2200002020200011 is an apocalyptic number.
200002020200011 is a deficient number, since it is larger than the sum of its proper divisors (1578318344629).
200002020200011 is a wasteful number, since it uses less digits than its factorization.
200002020200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27338313.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 200002020200011 its reverse (110002020200002), we get a palindrome (310004040400013).
Subtracting from 200002020200011 its reverse (110002020200002), we obtain a palindrome (90000000000009).
The spelling of 200002020200011 in words is "two hundred trillion, two billion, twenty million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •