Base | Representation |
---|---|
bin | 1010000001011100110010… |
… | …0000100110101000001101 |
3 | 1110000111121021222111020210 |
4 | 2200113030200212220031 |
5 | 2421023001141310013 |
6 | 35234310041033033 |
7 | 2215112265164463 |
oct | 240271440465015 |
9 | 43014537874223 |
10 | 11020022213133 |
11 | 356962427aa9a |
12 | 129b907185779 |
13 | 61c2505a854b |
14 | 2a152c7a0833 |
15 | 1419c9361cc3 |
hex | a05cc826a0d |
11020022213133 has 8 divisors (see below), whose sum is σ = 15332204818368. Its totient is φ = 7027260541664.
The previous prime is 11020022213119. The next prime is 11020022213153. The reversal of 11020022213133 is 33131222002011.
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 11020022213133 - 29 = 11020022212621 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020022213153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79855233360 + ... + 79855233497.
It is an arithmetic number, because the mean of its divisors is an integer number (1916525602296).
Almost surely, 211020022213133 is an apocalyptic number.
It is an amenable number.
11020022213133 is a deficient number, since it is larger than the sum of its proper divisors (4312182605235).
11020022213133 is a wasteful number, since it uses less digits than its factorization.
11020022213133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159710466883.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 11020022213133 its reverse (33131222002011), we get a palindrome (44151244215144).
The spelling of 11020022213133 in words is "eleven trillion, twenty billion, twenty-two million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •