Base | Representation |
---|---|
bin | 101101011110011010011111… |
… | …011000001011011001010011 |
3 | 222020011000102200201002102011 |
4 | 231132122133120023121103 |
5 | 202203313320440133021 |
6 | 1545211412254203351 |
7 | 60061451001562321 |
oct | 5536323730133123 |
9 | 866130380632364 |
10 | 200002121021011 |
11 | 587aa4722a9881 |
12 | 1a5219017b3557 |
13 | 877a171829aba |
14 | 37562235c2d11 |
15 | 181c7aa3a9de1 |
hex | b5e69f60b653 |
200002121021011 has 4 divisors (see below), whose sum is σ = 200004925502512. Its totient is φ = 199999316539512.
The previous prime is 200002121021009. The next prime is 200002121021039. The reversal of 200002121021011 is 110120121200002.
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 200002121021011 - 21 = 200002121021009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200002121020982 and 200002121021000.
It is not an unprimeable number, because it can be changed into a prime (200002121024011) 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, 1402133775 + ... + 1402276408.
It is an arithmetic number, because the mean of its divisors is an integer number (50001231375628).
Almost surely, 2200002121021011 is an apocalyptic number.
200002121021011 is a deficient number, since it is larger than the sum of its proper divisors (2804481501).
200002121021011 is an equidigital number, since it uses as much as digits as its factorization.
200002121021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2804481500.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200002121021011 its reverse (110120121200002), we get a palindrome (310122242221013).
The spelling of 200002121021011 in words is "two hundred trillion, two billion, one hundred twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •