Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …0001101000101111101111 |
3 | 1110101002020021012020011112 |
4 | 2201310200301220233233 |
5 | 2424143202333242312 |
6 | 35352320355542235 |
7 | 2225260265134661 |
oct | 241644061505757 |
9 | 43332207166145 |
10 | 11120220212207 |
11 | 35a8071451797 |
12 | 12b720b2ba97b |
13 | 62882b1215b2 |
14 | 2a6315c42531 |
15 | 1443e0b5cd22 |
hex | a1d20c68bef |
11120220212207 has 2 divisors, whose sum is σ = 11120220212208. Its totient is φ = 11120220212206.
The previous prime is 11120220212173. The next prime is 11120220212249. The reversal of 11120220212207 is 70221202202111.
11120220212207 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 is a cyclic number.
It is not a de Polignac number, because 11120220212207 - 238 = 10845342305263 is a prime.
It is a super-2 number, since 2×111202202122072 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120220202207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560110106103 + 5560110106104.
It is an arithmetic number, because the mean of its divisors is an integer number (5560110106104).
Almost surely, 211120220212207 is an apocalyptic number.
11120220212207 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120220212207 is an equidigital number, since it uses as much as digits as its factorization.
11120220212207 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 11120220212207 its reverse (70221202202111), we get a palindrome (81341422414318).
The spelling of 11120220212207 in words is "eleven trillion, one hundred twenty billion, two hundred twenty million, two hundred twelve thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •