Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …0111101010110110001011 |
3 | 1022210121112122022001221222 |
4 | 2103020231013222312023 |
5 | 2311130023130000021 |
6 | 33300551345552255 |
7 | 2062334505640346 |
oct | 223105507526613 |
9 | 38717478261858 |
10 | 10111110000011 |
11 | 3249108aa9609 |
12 | 117372634568b |
13 | 5846205c7967 |
14 | 26d5478d545d |
15 | 12802e6e96ab |
hex | 9322d1ead8b |
10111110000011 has 4 divisors (see below), whose sum is σ = 10119585365832. Its totient is φ = 10102634634192.
The previous prime is 10111109999909. The next prime is 10111110000059. The reversal of 10111110000011 is 11000001111101.
10111110000011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111110000011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111110000091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4237681121 + ... + 4237683506.
It is an arithmetic number, because the mean of its divisors is an integer number (2529896341458).
Almost surely, 210111110000011 is an apocalyptic number.
10111110000011 is a deficient number, since it is larger than the sum of its proper divisors (8475365821).
10111110000011 is an equidigital number, since it uses as much as digits as its factorization.
10111110000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8475365820.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10111110000011 its reverse (11000001111101), we get a palindrome (21111111111112).
The spelling of 10111110000011 in words is "ten trillion, one hundred eleven billion, one hundred ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •