Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …0111101011000101110011 |
3 | 1022210121112122022010100000 |
4 | 2103020231013223011303 |
5 | 2311130023130013021 |
6 | 33300551350001043 |
7 | 2062334505643305 |
oct | 223105507530563 |
9 | 38717478263300 |
10 | 10111110001011 |
11 | 3249108aaa338 |
12 | 1173726346183 |
13 | 5846205c8256 |
14 | 26d5478d5975 |
15 | 12802e6e9b26 |
hex | 9322d1eb173 |
10111110001011 has 24 divisors (see below), whose sum is σ = 15154530524224. Its totient is φ = 6736881251880.
The previous prime is 10111110000991. The next prime is 10111110001051. The reversal of 10111110001011 is 11010001111101.
10111110001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10111110001011 - 211 = 10111109998963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10111110000984 and 10111110001002.
It is not an unprimeable number, because it can be changed into a prime (10111110001051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11484325 + ... + 12333366.
Almost surely, 210111110001011 is an apocalyptic number.
10111110001011 is a deficient number, since it is larger than the sum of its proper divisors (5043420523213).
10111110001011 is an equidigital number, since it uses as much as digits as its factorization.
10111110001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23819453 (or 23819441 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111110001011 its reverse (11010001111101), we get a palindrome (21121111112112).
The spelling of 10111110001011 in words is "ten trillion, one hundred eleven billion, one hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •