Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1011101001111000010 |
3 | 201010021010000002202121 |
4 | 2322101211131033002 |
5 | 11234110304323020 |
6 | 231514522034454 |
7 | 20310313354036 |
oct | 2722145351702 |
9 | 633233002677 |
10 | 200011011010 |
11 | 77908001a08 |
12 | 3291b348a2a |
13 | 15b266a5c75 |
14 | 997574a1c6 |
15 | 53093ebbaa |
hex | 2e9195d3c2 |
200011011010 has 16 divisors (see below), whose sum is σ = 362008882872. Its totient is φ = 79562390400.
The previous prime is 200011010959. The next prime is 200011011017. The reversal of 200011011010 is 10110110002.
200011011010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 141814755889 + 58196255121 = 376583^2 + 241239^2 .
It is a junction number, because it is equal to n+sod(n) for n = 200011010984 and 200011011002.
It is not an unprimeable number, because it can be changed into a prime (200011011017) 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, 55249851 + ... + 55253470.
Almost surely, 2200011011010 is an apocalyptic number.
200011011010 is a deficient number, since it is larger than the sum of its proper divisors (161997871862).
200011011010 is a wasteful number, since it uses less digits than its factorization.
200011011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110503509.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 200011011010 its reverse (10110110002), we get a palindrome (210121121012).
The spelling of 200011011010 in words is "two hundred billion, eleven million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •