Base | Representation |
---|---|
bin | 101101011110011000100111… |
… | …101000011010001100011011 |
3 | 222020010211020200101202102100 |
4 | 231132120213220122030123 |
5 | 202203300212133310021 |
6 | 1545210441050134443 |
7 | 60061350135350355 |
oct | 5536304750321433 |
9 | 866124220352370 |
10 | 200000112010011 |
11 | 587a9631268105 |
12 | 1a521440a21423 |
13 | 8779c115490b1 |
14 | 37560b28600d5 |
15 | 181c6ddd17626 |
hex | b5e627a1a31b |
200000112010011 has 12 divisors (see below), whose sum is σ = 296696862862192. Its totient is φ = 129729802384656.
The previous prime is 200000112010007. The next prime is 200000112010099. The reversal of 200000112010011 is 110010211000002.
It is a happy number.
It is not a de Polignac number, because 200000112010011 - 22 = 200000112010007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200000112009975 and 200000112010002.
It is not an unprimeable number, because it can be changed into a prime (200000112010711) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 300300468151 + ... + 300300468816.
Almost surely, 2200000112010011 is an apocalyptic number.
200000112010011 is a deficient number, since it is larger than the sum of its proper divisors (96696750852181).
200000112010011 is a wasteful number, since it uses less digits than its factorization.
200000112010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600600937010 (or 600600937007 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200000112010011 its reverse (110010211000002), we get a palindrome (310010323010013).
The spelling of 200000112010011 in words is "two hundred trillion, one hundred twelve million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •