Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0111110111100010101111 |
3 | 1022210121021001012022012122 |
4 | 2103020212213313202233 |
5 | 2311124312224000421 |
6 | 33300532453423155 |
7 | 2062332013312364 |
oct | 223104647674257 |
9 | 38717231168178 |
10 | 10111001000111 |
11 | 3249062520350 |
12 | 11736b593aabb |
13 | 584603b5288b |
14 | 26d53724046b |
15 | 128024d682ab |
hex | 932269f78af |
10111001000111 has 4 divisors (see below), whose sum is σ = 11030182909224. Its totient is φ = 9191819091000.
The previous prime is 10111001000083. The next prime is 10111001000159. The reversal of 10111001000111 is 11100010011101.
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-10111001000111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111001000411) 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, 459590954540 + ... + 459590954561.
It is an arithmetic number, because the mean of its divisors is an integer number (2757545727306).
Almost surely, 210111001000111 is an apocalyptic number.
10111001000111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10111001000111 is a deficient number, since it is larger than the sum of its proper divisors (919181909113).
10111001000111 is an equidigital number, since it uses as much as digits as its factorization.
10111001000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919181909112.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10111001000111 its reverse (11100010011101), we get a palindrome (21211011011212).
The spelling of 10111001000111 in words is "ten trillion, one hundred eleven billion, one 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 •