Base | Representation |
---|---|
bin | 101101011110011000100001… |
… | …100100000111100110111011 |
3 | 222020010210222120212101112102 |
4 | 231132120201210013212323 |
5 | 202203300010104101021 |
6 | 1545210423012334015 |
7 | 60061344461230346 |
oct | 5536304144074673 |
9 | 866123876771472 |
10 | 200000010222011 |
11 | 587a958986529a |
12 | 1a52141291430b |
13 | 8779bc642a7cc |
14 | 37560a312545d |
15 | 181c6d4e0d00b |
hex | b5e6219079bb |
200000010222011 has 8 divisors (see below), whose sum is σ = 206425510175040. Its totient is φ = 193675699244808.
The previous prime is 200000010221989. The next prime is 200000010222041. The reversal of 200000010222011 is 110222010000002.
It is a happy number.
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 200000010222011 - 226 = 199999943113147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200000010221983 and 200000010222001.
It is not an unprimeable number, because it can be changed into a prime (200000010222041) 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, 25297239941 + ... + 25297247846.
It is an arithmetic number, because the mean of its divisors is an integer number (25803188771880).
Almost surely, 2200000010222011 is an apocalyptic number.
200000010222011 is a deficient number, since it is larger than the sum of its proper divisors (6425499953029).
200000010222011 is an equidigital number, since it uses as much as digits as its factorization.
200000010222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50594487913.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200000010222011 its reverse (110222010000002), we get a palindrome (310222020222013).
The spelling of 200000010222011 in words is "two hundred trillion, ten million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •