Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1011101000000111110 |
3 | 201010021010000001112021 |
4 | 2322101211131000332 |
5 | 11234110304310420 |
6 | 231514522030354 |
7 | 20310313351312 |
oct | 2722145350076 |
9 | 633233001467 |
10 | 200011010110 |
11 | 7790800126a |
12 | 3291b3483ba |
13 | 15b266a5732 |
14 | 9975749b42 |
15 | 53093eb7aa |
hex | 2e9195d03e |
200011010110 has 16 divisors (see below), whose sum is σ = 360061294896. Its totient is φ = 79995187008.
The previous prime is 200011010099. The next prime is 200011010113. The reversal of 200011010110 is 11010110002.
200011010110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200011010093 and 200011010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200011010113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1060644 + ... + 1234903.
It is an arithmetic number, because the mean of its divisors is an integer number (22503830931).
Almost surely, 2200011010110 is an apocalyptic number.
200011010110 is a deficient number, since it is larger than the sum of its proper divisors (160050284786).
200011010110 is a wasteful number, since it uses less digits than its factorization.
200011010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304267.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 200011010110 its reverse (11010110002), we get a palindrome (211021120112).
The spelling of 200011010110 in words is "two hundred billion, eleven million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •