Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …1110110101100010101101 |
3 | 1102222112222221202200020202 |
4 | 2200031331032311202231 |
5 | 2420342142132032343 |
6 | 35225545433123245 |
7 | 2214311411510522 |
oct | 240157516654255 |
9 | 42875887680222 |
10 | 11010102220973 |
11 | 35653a3742069 |
12 | 12999b8b59525 |
13 | 61b32c351bbb |
14 | 2a0c6b107149 |
15 | 1415e8509db8 |
hex | a037d3b58ad |
11010102220973 has 2 divisors, whose sum is σ = 11010102220974. Its totient is φ = 11010102220972.
The previous prime is 11010102220933. The next prime is 11010102221017. The reversal of 11010102220973 is 37902220101011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9630365378089 + 1379736842884 = 3103283^2 + 1174622^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010102220973 - 218 = 11010101958829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010102220933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505051110486 + 5505051110487.
It is an arithmetic number, because the mean of its divisors is an integer number (5505051110487).
Almost surely, 211010102220973 is an apocalyptic number.
It is an amenable number.
11010102220973 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010102220973 is an equidigital number, since it uses as much as digits as its factorization.
11010102220973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 29.
Adding to 11010102220973 its reverse (37902220101011), we get a palindrome (48912322321984).
The spelling of 11010102220973 in words is "eleven trillion, ten billion, one hundred two million, two hundred twenty thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •