Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1110000110101001001101 |
3 | 1110022100020212122212101202 |
4 | 2201203203332012221031 |
5 | 2423343414132413122 |
6 | 35340110410315245 |
7 | 2224044260450633 |
oct | 241434376065115 |
9 | 43270225585352 |
10 | 11102020201037 |
11 | 35a0381a79a47 |
12 | 12b3790128b25 |
13 | 626bba63190c |
14 | 2a54aaa2d353 |
15 | 143bc7e46e92 |
hex | a18e3f86a4d |
11102020201037 has 2 divisors, whose sum is σ = 11102020201038. Its totient is φ = 11102020201036.
The previous prime is 11102020201001. The next prime is 11102020201079. The reversal of 11102020201037 is 73010202020111.
11102020201037 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., 11074925065801 + 27095135236 = 3327901^2 + 164606^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102020201037 - 216 = 11102020135501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102020203037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551010100518 + 5551010100519.
It is an arithmetic number, because the mean of its divisors is an integer number (5551010100519).
Almost surely, 211102020201037 is an apocalyptic number.
It is an amenable number.
11102020201037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102020201037 is an equidigital number, since it uses as much as digits as its factorization.
11102020201037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 11102020201037 its reverse (73010202020111), we get a palindrome (84112222221148).
The spelling of 11102020201037 in words is "eleven trillion, one hundred two billion, twenty million, two hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •