Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …1000011010011000101001 |
3 | 1110000111211120120102210012 |
4 | 2200113101320122120221 |
5 | 2421023142224344041 |
6 | 35234323020501305 |
7 | 2215114441230524 |
oct | 240272170323051 |
9 | 43014746512705 |
10 | 11020112340521 |
11 | 3569670139039 |
12 | 129b9313aa835 |
13 | 61c26617346b |
14 | 2a153a741bbb |
15 | 1419d22163eb |
hex | a05d1e1a629 |
11020112340521 has 8 divisors (see below), whose sum is σ = 11600573260320. Its totient is φ = 10439696921472.
The previous prime is 11020112340493. The next prime is 11020112340551. The reversal of 11020112340521 is 12504321102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11020112340521 - 210 = 11020112339497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020112340551) 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 in 7 ways as a sum of consecutive naturals, for example, 10877480 + ... + 11847353.
It is an arithmetic number, because the mean of its divisors is an integer number (1450071657540).
Almost surely, 211020112340521 is an apocalyptic number.
It is an amenable number.
11020112340521 is a deficient number, since it is larger than the sum of its proper divisors (580460919799).
11020112340521 is a wasteful number, since it uses less digits than its factorization.
11020112340521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22750375.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 11020112340521 its reverse (12504321102011), we get a palindrome (23524433442532).
The spelling of 11020112340521 in words is "eleven trillion, twenty billion, one hundred twelve million, three hundred forty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •