Base | Representation |
---|---|
bin | 101101011110011000100111… |
… | …100101010111001000001111 |
3 | 222020010211020121220011102012 |
4 | 231132120213211113020033 |
5 | 202203300211432223043 |
6 | 1545210441021051435 |
7 | 60061350125512064 |
oct | 5536304745271017 |
9 | 866124217804365 |
10 | 200000111211023 |
11 | 587a9630871892 |
12 | 1a5214406b6b7b |
13 | 8779c11329516 |
14 | 37560b26d2c6b |
15 | 181c6ddc0aa18 |
hex | b5e62795720f |
200000111211023 has 8 divisors (see below), whose sum is σ = 200467750014000. Its totient is φ = 199532571094528.
The previous prime is 200000111210989. The next prime is 200000111211119. The reversal of 200000111211023 is 320112111000002.
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 200000111211023 - 210 = 200000111209999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200000111210989 and 200000111211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200000111219023) 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, 20612861 + ... + 28720902.
It is an arithmetic number, because the mean of its divisors is an integer number (25058468751750).
Almost surely, 2200000111211023 is an apocalyptic number.
200000111211023 is a deficient number, since it is larger than the sum of its proper divisors (467638802977).
200000111211023 is an equidigital number, since it uses as much as digits as its factorization.
200000111211023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49343241.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200000111211023 its reverse (320112111000002), we get a palindrome (520112222211025).
The spelling of 200000111211023 in words is "two hundred trillion, one hundred eleven million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •