Base | Representation |
---|---|
bin | 1010000001100001100111… |
… | …1110111110010010101101 |
3 | 1110000121221212210112002100 |
4 | 2200120121332332102231 |
5 | 2421033131414120023 |
6 | 35235043032245313 |
7 | 2215156430312064 |
oct | 240303176762255 |
9 | 43017855715070 |
10 | 11021322020013 |
11 | 356a130a56158 |
12 | 12a000a540839 |
13 | 61c3c9976646 |
14 | 2a16132711db |
15 | 141a53514c43 |
hex | a0619fbe4ad |
11021322020013 has 24 divisors (see below), whose sum is σ = 16468998923520. Its totient is φ = 7094030580000.
The previous prime is 11021322019993. The next prime is 11021322020039. The reversal of 11021322020013 is 31002022312011.
11021322020013 is a `hidden beast` number, since 110 + 21 + 322 + 0 + 200 + 13 = 666.
It is not a de Polignac number, because 11021322020013 - 218 = 11021321757869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021322060013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12290920 + ... + 13157102.
It is an arithmetic number, because the mean of its divisors is an integer number (686208288480).
Almost surely, 211021322020013 is an apocalyptic number.
It is an amenable number.
11021322020013 is a deficient number, since it is larger than the sum of its proper divisors (5447676903507).
11021322020013 is a wasteful number, since it uses less digits than its factorization.
11021322020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914969 (or 914966 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11021322020013 its reverse (31002022312011), we get a palindrome (42023344332024).
The spelling of 11021322020013 in words is "eleven trillion, twenty-one billion, three hundred twenty-two million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •