Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1110111000100111100101 |
3 | 1110022100020220001021012002 |
4 | 2201203203332320213211 |
5 | 2423343414210440413 |
6 | 35340110414535045 |
7 | 2224044262262465 |
oct | 241434376704745 |
9 | 43270226037162 |
10 | 11102020405733 |
11 | 35a03820a9814 |
12 | 12b3790207485 |
13 | 626bba6a3b3a |
14 | 2a54aaa83ba5 |
15 | 143bc7e87958 |
hex | a18e3fb89e5 |
11102020405733 has 8 divisors (see below), whose sum is σ = 11174841619968. Its totient is φ = 11029225871664.
The previous prime is 11102020405727. The next prime is 11102020405741. The reversal of 11102020405733 is 33750402020111.
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 11102020405733 - 218 = 11102020143589 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102020405696 and 11102020405705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102020405783) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5834741 + ... + 7499882.
It is an arithmetic number, because the mean of its divisors is an integer number (1396855202496).
Almost surely, 211102020405733 is an apocalyptic number.
It is an amenable number.
11102020405733 is a deficient number, since it is larger than the sum of its proper divisors (72821214235).
11102020405733 is a wasteful number, since it uses less digits than its factorization.
11102020405733 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13340083.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 11102020405733 its reverse (33750402020111), we get a palindrome (44852422425844).
The spelling of 11102020405733 in words is "eleven trillion, one hundred two billion, twenty million, four hundred five thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •