Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …1110000000111100101111 |
3 | 1022210121021202000100122000 |
4 | 2103020213032000330233 |
5 | 2311124322304000421 |
6 | 33300533452023343 |
7 | 2062332164312040 |
oct | 223104716007457 |
9 | 38717252010560 |
10 | 10111011000111 |
11 | 324906813050a |
12 | 11736b9161b53 |
13 | 584605c44438 |
14 | 26d5386c48c7 |
15 | 128025b91226 |
hex | 93227380f2f |
10111011000111 has 32 divisors (see below), whose sum is σ = 17121017195520. Its totient is φ = 5777097839712.
The previous prime is 10111011000107. The next prime is 10111011000149. The reversal of 10111011000111 is 11100011011101.
It is not a de Polignac number, because 10111011000111 - 22 = 10111011000107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10111011000093 and 10111011000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111011000161) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1121995 + ... + 4634748.
It is an arithmetic number, because the mean of its divisors is an integer number (535031787360).
Almost surely, 210111011000111 is an apocalyptic number.
10111011000111 is a deficient number, since it is larger than the sum of its proper divisors (7010006195409).
10111011000111 is an equidigital number, since it uses as much as digits as its factorization.
10111011000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5766052 (or 5766046 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10111011000111 its reverse (11100011011101), we get a palindrome (21211022011212).
The spelling of 10111011000111 in words is "ten trillion, one hundred eleven billion, eleven million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •