Base | Representation |
---|---|
bin | 1010000110001110111011… |
… | …0000101000101111101001 |
3 | 1110022100201111021120211111 |
4 | 2201203232300220233221 |
5 | 2423344302003020243 |
6 | 35340140354230321 |
7 | 2224051616212135 |
oct | 241435660505751 |
9 | 43270644246744 |
10 | 11102201220073 |
11 | 35a0465178257 |
12 | 12b38208853a1 |
13 | 626c18ca1582 |
14 | 2a54c6ab03c5 |
15 | 143bd8ca239d |
hex | a18eec28be9 |
11102201220073 has 2 divisors, whose sum is σ = 11102201220074. Its totient is φ = 11102201220072.
The previous prime is 11102201220067. The next prime is 11102201220137. The reversal of 11102201220073 is 37002210220111.
11102201220073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6475004427609 + 4627196792464 = 2544603^2 + 2151092^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102201220073 - 221 = 11102199122921 is a prime.
It is not a weakly prime, because it can be changed into another prime (11102201220013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551100610036 + 5551100610037.
It is an arithmetic number, because the mean of its divisors is an integer number (5551100610037).
Almost surely, 211102201220073 is an apocalyptic number.
It is an amenable number.
11102201220073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102201220073 is an equidigital number, since it uses as much as digits as its factorization.
11102201220073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 11102201220073 its reverse (37002210220111), we get a palindrome (48104411440184).
The spelling of 11102201220073 in words is "eleven trillion, one hundred two billion, two hundred one million, two hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •