Base | Representation |
---|---|
bin | 1010000001011100110001… |
… | …1000001111011110000010 |
3 | 1110000111121010212010101012 |
4 | 2200113030120033132002 |
5 | 2421023000111133442 |
6 | 35234305522040522 |
7 | 2215112240435000 |
oct | 240271430173602 |
9 | 43014533763335 |
10 | 11020020021122 |
11 | 3569623013112 |
12 | 129b9064a9142 |
13 | 61c24ccbb8b8 |
14 | 2a152c38da70 |
15 | 1419c907c582 |
hex | a05cc60f782 |
11020020021122 has 128 divisors (see below), whose sum is σ = 20057103360000. Its totient is φ = 4536661409280.
The previous prime is 11020020021097. The next prime is 11020020021149. The reversal of 11020020021122 is 22112002002011.
It is a super-3 number, since 3×110200200211223 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 11020020021097 and 11020020021106.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 310134497 + ... + 310170027.
It is an arithmetic number, because the mean of its divisors is an integer number (156696120000).
Almost surely, 211020020021122 is an apocalyptic number.
11020020021122 is a deficient number, since it is larger than the sum of its proper divisors (9037083338878).
11020020021122 is an equidigital number, since it uses as much as digits as its factorization.
11020020021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35789 (or 35775 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11020020021122 its reverse (22112002002011), we get a palindrome (33132022023133).
The spelling of 11020020021122 in words is "eleven trillion, twenty billion, twenty million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.737 sec. • engine limits •