Base | Representation |
---|---|
bin | 1010000000011101110001… |
… | …1101101111111111001111 |
3 | 1102221212221122201122020021 |
4 | 2200013130131233333033 |
5 | 2420233332132000221 |
6 | 35222431534203011 |
7 | 2213643216051106 |
oct | 240073435577717 |
9 | 42855848648207 |
10 | 11003110031311 |
11 | 3562435842522 |
12 | 1298587353467 |
13 | 61a786851c78 |
14 | 2a07a662103d |
15 | 141339735041 |
hex | a01dc76ffcf |
11003110031311 has 2 divisors, whose sum is σ = 11003110031312. Its totient is φ = 11003110031310.
The previous prime is 11003110031233. The next prime is 11003110031321. The reversal of 11003110031311 is 11313001130011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11003110031311 - 213 = 11003110023119 is a prime.
It is a super-2 number, since 2×110031100313112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11003110031321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501555015655 + 5501555015656.
It is an arithmetic number, because the mean of its divisors is an integer number (5501555015656).
Almost surely, 211003110031311 is an apocalyptic number.
11003110031311 is a deficient number, since it is larger than the sum of its proper divisors (1).
11003110031311 is an equidigital number, since it uses as much as digits as its factorization.
11003110031311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 11003110031311 its reverse (11313001130011), we get a palindrome (22316111161322).
The spelling of 11003110031311 in words is "eleven trillion, three billion, one hundred ten million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •