Base | Representation |
---|---|
bin | 1010000001100000100000… |
… | …0110111010100011111101 |
3 | 1110000121011222110121122001 |
4 | 2200120020012322203331 |
5 | 2421032023130040442 |
6 | 35234553200222301 |
7 | 2215146126164512 |
oct | 240301006724375 |
9 | 43017158417561 |
10 | 11021022111997 |
11 | 3569a97734897 |
12 | 129bb4600a991 |
13 | 61c37c7ab691 |
14 | 2a15c54c3309 |
15 | 141a370232b7 |
hex | a06081ba8fd |
11021022111997 has 2 divisors, whose sum is σ = 11021022111998. Its totient is φ = 11021022111996.
The previous prime is 11021022111977. The next prime is 11021022112021. The reversal of 11021022111997 is 79911122012011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8938790427961 + 2082231684036 = 2989781^2 + 1442994^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021022111997 - 239 = 10471266298109 is a prime.
It is a super-2 number, since 2×110210221119972 (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 (11021022111907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510511055998 + 5510511055999.
It is an arithmetic number, because the mean of its divisors is an integer number (5510511055999).
Almost surely, 211021022111997 is an apocalyptic number.
It is an amenable number.
11021022111997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021022111997 is an equidigital number, since it uses as much as digits as its factorization.
11021022111997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 37.
The spelling of 11021022111997 in words is "eleven trillion, twenty-one billion, twenty-two million, one hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •