Base | Representation |
---|---|
bin | 10010101000001110… |
… | …01010110011101011 |
3 | 221210222211112001112 |
4 | 21110013022303223 |
5 | 130440240200021 |
6 | 4332222140535 |
7 | 502556642660 |
oct | 112407126353 |
9 | 27728745045 |
10 | 10001100011 |
11 | 42723a6511 |
12 | 1b3142174b |
13 | c34cb4076 |
14 | 6ac36ba67 |
15 | 3d8028d5b |
hex | 2541caceb |
10001100011 has 16 divisors (see below), whose sum is σ = 11494264320. Its totient is φ = 8524180800.
The previous prime is 10001100001. The next prime is 10001100019. The reversal of 10001100011 is 11000110001.
10001100011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10001100011 - 214 = 10001083627 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001099968 and 10001100004.
It is not an unprimeable number, because it can be changed into a prime (10001100019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 938111 + ... + 948711.
It is an arithmetic number, because the mean of its divisors is an integer number (718391520).
Almost surely, 210001100011 is an apocalyptic number.
10001100011 is a deficient number, since it is larger than the sum of its proper divisors (1493164309).
10001100011 is a wasteful number, since it uses less digits than its factorization.
10001100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11354.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10001100011 its reverse (11000110001), we get a palindrome (21001210012).
It can be divided in two parts, 1000 and 1100011, that added together give a palindrome (1101011).
The spelling of 10001100011 in words is "ten billion, one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •