Base | Representation |
---|---|
bin | 11110000000100100101… |
… | …10110001010100011111 |
3 | 10122120110010202201020002 |
4 | 33000102112301110133 |
5 | 113343143112010421 |
6 | 2105403021444515 |
7 | 134331423220001 |
oct | 17002226612437 |
9 | 3576403681202 |
10 | 1031100110111 |
11 | 368318149a35 |
12 | 147a0141073b |
13 | 7630354c766 |
14 | 37c96a1c371 |
15 | 1bc4bc48b0b |
hex | f0125b151f |
1031100110111 has 2 divisors, whose sum is σ = 1031100110112. Its totient is φ = 1031100110110.
The previous prime is 1031100110069. The next prime is 1031100110123. The reversal of 1031100110111 is 1110110011301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1031100110111 - 226 = 1031033001247 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031100110092 and 1031100110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031100110141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515550055055 + 515550055056.
It is an arithmetic number, because the mean of its divisors is an integer number (515550055056).
Almost surely, 21031100110111 is an apocalyptic number.
1031100110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031100110111 is an equidigital number, since it uses as much as digits as its factorization.
1031100110111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 1031100110111 its reverse (1110110011301), we get a palindrome (2141210121412).
The spelling of 1031100110111 in words is "one trillion, thirty-one billion, one hundred million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •