Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …1010111100110010110101 |
3 | 1102222112222212211220121202 |
4 | 2200031331022330302311 |
5 | 2420342141401431401 |
6 | 35225545355222245 |
7 | 2214311400035201 |
oct | 240157512746265 |
9 | 42875885756552 |
10 | 11010101202101 |
11 | 35653a3106621 |
12 | 12999b8747985 |
13 | 61b32c086211 |
14 | 2a0c6ad1db01 |
15 | 1415e83a806b |
hex | a037d2bccb5 |
11010101202101 has 2 divisors, whose sum is σ = 11010101202102. Its totient is φ = 11010101202100.
The previous prime is 11010101202019. The next prime is 11010101202109. The reversal of 11010101202101 is 10120210101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7811186522500 + 3198914679601 = 2794850^2 + 1788551^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010101202101 - 238 = 10735223295157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010101202109) 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, 5505050601050 + 5505050601051.
It is an arithmetic number, because the mean of its divisors is an integer number (5505050601051).
Almost surely, 211010101202101 is an apocalyptic number.
It is an amenable number.
11010101202101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010101202101 is an equidigital number, since it uses as much as digits as its factorization.
11010101202101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11010101202101 its reverse (10120210101011), we get a palindrome (21130311303112).
The spelling of 11010101202101 in words is "eleven trillion, ten billion, one hundred one million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •