Base | Representation |
---|---|
bin | 1010000001011100110001… |
… | …1100011001100011111101 |
3 | 1110000111121012220111110102 |
4 | 2200113030130121203331 |
5 | 2421023000401023122 |
6 | 35234310001250445 |
7 | 2215112252624411 |
oct | 240271434314375 |
9 | 43014535814412 |
10 | 11020021111037 |
11 | 3569623697a74 |
12 | 129b906933a25 |
13 | 61c2502b0a13 |
14 | 2a152c594d41 |
15 | 1419c91e5492 |
hex | a05cc7198fd |
11020021111037 has 2 divisors, whose sum is σ = 11020021111038. Its totient is φ = 11020021111036.
The previous prime is 11020021110991. The next prime is 11020021111049. The reversal of 11020021111037 is 73011112002011.
11020021111037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10658566444516 + 361454666521 = 3264746^2 + 601211^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020021111037 - 28 = 11020021110781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020021111067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510010555518 + 5510010555519.
It is an arithmetic number, because the mean of its divisors is an integer number (5510010555519).
Almost surely, 211020021111037 is an apocalyptic number.
It is an amenable number.
11020021111037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020021111037 is an equidigital number, since it uses as much as digits as its factorization.
11020021111037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 11020021111037 its reverse (73011112002011), we get a palindrome (84031133113048).
The spelling of 11020021111037 in words is "eleven trillion, twenty billion, twenty-one million, one hundred eleven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •