Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110110011100001111111 |
3 | 10220011120122010020022201 |
4 | 100000203232303201333 |
5 | 121011011420200111 |
6 | 2201214542452331 |
7 | 142323531030226 |
oct | 20004356634177 |
9 | 3804518106281 |
10 | 1100111100031 |
11 | 3946110440a9 |
12 | 159260b940a7 |
13 | 7c980b07238 |
14 | 3b362147cbd |
15 | 1d93a5e96c1 |
hex | 10023bb387f |
1100111100031 has 2 divisors, whose sum is σ = 1100111100032. Its totient is φ = 1100111100030.
The previous prime is 1100111100007. The next prime is 1100111100041. The reversal of 1100111100031 is 1300011110011.
It is an a-pointer prime, because the next prime (1100111100041) can be obtained adding 1100111100031 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100111100031 - 27 = 1100111099903 is a prime.
It is a super-2 number, since 2×11001111000312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100111099990 and 1100111100017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100111100041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550055550015 + 550055550016.
It is an arithmetic number, because the mean of its divisors is an integer number (550055550016).
Almost surely, 21100111100031 is an apocalyptic number.
1100111100031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100111100031 is an equidigital number, since it uses as much as digits as its factorization.
1100111100031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 1100111100031 its reverse (1300011110011), we get a palindrome (2400122210042).
The spelling of 1100111100031 in words is "one trillion, one hundred billion, one hundred eleven million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •