Base | Representation |
---|---|
bin | 10110110000110011101110… |
… | …100011110110100100000111 |
3 | 111010110112020200202221101202 |
4 | 112300303232203312210013 |
5 | 101110210013112023421 |
6 | 552530223211413115 |
7 | 30041534246410565 |
oct | 2660635643664407 |
9 | 433415220687352 |
10 | 100111100111111 |
11 | 29997974138021 |
12 | b28a250a5419b |
13 | 43b258953226b |
14 | 1aa1590162a35 |
15 | b891bd27110b |
hex | 5b0cee8f6907 |
100111100111111 has 2 divisors, whose sum is σ = 100111100111112. Its totient is φ = 100111100111110.
The previous prime is 100111100111027. The next prime is 100111100111129. The reversal of 100111100111111 is 111111001111001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100111100111111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100111100111092 and 100111100111101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100111100411111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055550055555 + 50055550055556.
It is an arithmetic number, because the mean of its divisors is an integer number (50055550055556).
Almost surely, 2100111100111111 is an apocalyptic number.
100111100111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111100111111 is an equidigital number, since it uses as much as digits as its factorization.
100111100111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 100111100111111 its reverse (111111001111001), we get a palindrome (211222101222112).
It can be divided in two parts, 1001111001 and 11111, that multiplied together give a palindrome (11123344332111).
The spelling of 100111100111111 in words is "one hundred trillion, one hundred eleven billion, one hundred million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •