Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …0010101000111100001101 |
3 | 1110122211001022210222000001 |
4 | 2202333312302220330031 |
5 | 2432004343233220301 |
6 | 35453420143404301 |
7 | 2234153125600621 |
oct | 242776662507415 |
9 | 43584038728001 |
10 | 11201120210701 |
11 | 3629406389a83 |
12 | 130aa285b3691 |
13 | 63335184c1a5 |
14 | 2aa1cc337181 |
15 | 146578157c01 |
hex | a2ff6ca8f0d |
11201120210701 has 2 divisors, whose sum is σ = 11201120210702. Its totient is φ = 11201120210700.
The previous prime is 11201120210677. The next prime is 11201120210789. The reversal of 11201120210701 is 10701202110211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10692416045476 + 508704165225 = 3269926^2 + 713235^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201120210701 - 211 = 11201120208653 is a prime.
It is a super-2 number, since 2×112011202107012 (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 (11201120210101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600560105350 + 5600560105351.
It is an arithmetic number, because the mean of its divisors is an integer number (5600560105351).
Almost surely, 211201120210701 is an apocalyptic number.
It is an amenable number.
11201120210701 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201120210701 is an equidigital number, since it uses as much as digits as its factorization.
11201120210701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 11201120210701 its reverse (10701202110211), we get a palindrome (21902322320912).
The spelling of 11201120210701 in words is "eleven trillion, two hundred one billion, one hundred twenty million, two hundred ten thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •