Base | Representation |
---|---|
bin | 10000000000100101000… |
… | …011100010101000000111 |
3 | 10220011122011220202211102 |
4 | 100000211003202220013 |
5 | 121011033112004111 |
6 | 2201221054530315 |
7 | 142324220604164 |
oct | 20004503425007 |
9 | 3804564822742 |
10 | 1100133313031 |
11 | 394622636055 |
12 | 15926850699b |
13 | 7c9855b3a1c |
14 | 3b36508b06b |
15 | 1d93c53613b |
hex | 100250e2a07 |
1100133313031 has 2 divisors, whose sum is σ = 1100133313032. Its totient is φ = 1100133313030.
The previous prime is 1100133312959. The next prime is 1100133313063. The reversal of 1100133313031 is 1303133310011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100133313031 is a prime.
It is a super-2 number, since 2×11001333130312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100133312994 and 1100133313012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100133343031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550066656515 + 550066656516.
It is an arithmetic number, because the mean of its divisors is an integer number (550066656516).
Almost surely, 21100133313031 is an apocalyptic number.
1100133313031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100133313031 is an equidigital number, since it uses as much as digits as its factorization.
1100133313031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 1100133313031 its reverse (1303133310011), we get a palindrome (2403266623042).
The spelling of 1100133313031 in words is "one trillion, one hundred billion, one hundred thirty-three million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •