Base | Representation |
---|---|
bin | 1010000001011101001110… |
… | …0010110101110111010001 |
3 | 1110000111220112001220010201 |
4 | 2200113103202311313101 |
5 | 2421023221400142322 |
6 | 35234325454455201 |
7 | 2215115230331224 |
oct | 240272342656721 |
9 | 43014815056121 |
10 | 11020140240337 |
11 | 3569684964638 |
12 | 129b93a804501 |
13 | 61c26bb91527 |
14 | 2a15403255bb |
15 | 1419d48c7d27 |
hex | a05d38b5dd1 |
11020140240337 has 2 divisors, whose sum is σ = 11020140240338. Its totient is φ = 11020140240336.
The previous prime is 11020140240281. The next prime is 11020140240359. The reversal of 11020140240337 is 73304204102011.
11020140240337 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., 10685112278481 + 335027961856 = 3268809^2 + 578816^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020140240337 - 215 = 11020140207569 is a prime.
It is not a weakly prime, because it can be changed into another prime (11020140240737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510070120168 + 5510070120169.
It is an arithmetic number, because the mean of its divisors is an integer number (5510070120169).
Almost surely, 211020140240337 is an apocalyptic number.
It is an amenable number.
11020140240337 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020140240337 is an equidigital number, since it uses as much as digits as its factorization.
11020140240337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 11020140240337 its reverse (73304204102011), we get a palindrome (84324344342348).
The spelling of 11020140240337 in words is "eleven trillion, twenty billion, one hundred forty million, two hundred forty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •