Base | Representation |
---|---|
bin | 10000000001011010101… |
… | …000100110011010010111 |
3 | 10220020221211100222210122 |
4 | 100001122220212122113 |
5 | 121014403222022221 |
6 | 2201450205342155 |
7 | 142355414312132 |
oct | 20013250463227 |
9 | 3806854328718 |
10 | 1101032220311 |
11 | 394a43a91431 |
12 | 15947956795b |
13 | 7ca998b6c1a |
14 | 3b40c601219 |
15 | 1d9913e8eab |
hex | 1005aa26697 |
1101032220311 has 2 divisors, whose sum is σ = 1101032220312. Its totient is φ = 1101032220310.
The previous prime is 1101032220287. The next prime is 1101032220329. The reversal of 1101032220311 is 1130222301011.
It is a strong prime.
It is an emirp because it is prime and its reverse (1130222301011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101032220311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101032220311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101032220341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550516110155 + 550516110156.
It is an arithmetic number, because the mean of its divisors is an integer number (550516110156).
Almost surely, 21101032220311 is an apocalyptic number.
1101032220311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101032220311 is an equidigital number, since it uses as much as digits as its factorization.
1101032220311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1101032220311 its reverse (1130222301011), we get a palindrome (2231254521322).
The spelling of 1101032220311 in words is "one trillion, one hundred one billion, thirty-two million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •