Base | Representation |
---|---|
bin | 1010001011111011010101… |
… | …0001111001110101010101 |
3 | 1110122201012201122212102102 |
4 | 2202332311101321311111 |
5 | 2432000120401010401 |
6 | 35453115122051445 |
7 | 2234113651441655 |
oct | 242766521716525 |
9 | 43581181585372 |
10 | 11200021110101 |
11 | 36289a1a2947a |
12 | 130a7804a9b85 |
13 | 633207c249c5 |
14 | 2aa126390365 |
15 | 1465118ed56b |
hex | a2fb5479d55 |
11200021110101 has 2 divisors, whose sum is σ = 11200021110102. Its totient is φ = 11200021110100.
The previous prime is 11200021110097. The next prime is 11200021110151. The reversal of 11200021110101 is 10101112000211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7560602619025 + 3639418491076 = 2749655^2 + 1907726^2 .
It is a cyclic number.
It is not a de Polignac number, because 11200021110101 - 22 = 11200021110097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200021110151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600010555050 + 5600010555051.
It is an arithmetic number, because the mean of its divisors is an integer number (5600010555051).
Almost surely, 211200021110101 is an apocalyptic number.
It is an amenable number.
11200021110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200021110101 is an equidigital number, since it uses as much as digits as its factorization.
11200021110101 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 11200021110101 its reverse (10101112000211), we get a palindrome (21301133110312).
It can be divided in two parts, 112000211 and 10101, that multiplied together give a palindrome (1131314131311).
The spelling of 11200021110101 in words is "eleven trillion, two hundred billion, twenty-one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •