Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1101110011010110010000 |
3 | 1110022100020212111211222110 |
4 | 2201203203331303112100 |
5 | 2423343414122401000 |
6 | 35340110404505320 |
7 | 2224044260001333 |
oct | 241434375632620 |
9 | 43270225454873 |
10 | 11102020122000 |
11 | 35a0381a25625 |
12 | 12b37900ab240 |
13 | 626bba604952 |
14 | 2a54aaa0c61a |
15 | 143bc7e2d850 |
hex | a18e3f73590 |
11102020122000 has 80 divisors (see below), whose sum is σ = 35792912892672. Its totient is φ = 2960538697600.
The previous prime is 11102020121971. The next prime is 11102020122019. The reversal of 11102020122000 is 22102020111.
11102020122000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 925162344 + ... + 925174343.
Almost surely, 211102020122000 is an apocalyptic number.
11102020122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102020122000 is an abundant number, since it is smaller than the sum of its proper divisors (24690892770672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102020122000 is a wasteful number, since it uses less digits than its factorization.
11102020122000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1850336713 (or 1850336697 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11102020122000 its reverse (22102020111), we get a palindrome (11124122142111).
The spelling of 11102020122000 in words is "eleven trillion, one hundred two billion, twenty million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •