Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …1000011010011000001101 |
3 | 1110000111211120120102202011 |
4 | 2200113101320122120031 |
5 | 2421023142224343433 |
6 | 35234323020501221 |
7 | 2215114441230454 |
oct | 240272170323015 |
9 | 43014746512664 |
10 | 11020112340493 |
11 | 3569670139013 |
12 | 129b9313aa811 |
13 | 61c266173449 |
14 | 2a153a741b9b |
15 | 1419d22163cd |
hex | a05d1e1a60d |
11020112340493 has 2 divisors, whose sum is σ = 11020112340494. Its totient is φ = 11020112340492.
The previous prime is 11020112340469. The next prime is 11020112340551. The reversal of 11020112340493 is 39404321102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10615104834889 + 405007505604 = 3258083^2 + 636402^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020112340493 - 29 = 11020112339981 is a prime.
It is a super-2 number, since 2×110201123404932 (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 (11020112347493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510056170246 + 5510056170247.
It is an arithmetic number, because the mean of its divisors is an integer number (5510056170247).
Almost surely, 211020112340493 is an apocalyptic number.
It is an amenable number.
11020112340493 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020112340493 is an equidigital number, since it uses as much as digits as its factorization.
11020112340493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 11020112340493 in words is "eleven trillion, twenty billion, one hundred twelve million, three hundred forty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •