Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …0011110000111001100100 |
3 | 1110000111211111021112022112 |
4 | 2200113101303300321210 |
5 | 2421023141421401040 |
6 | 35234322534420152 |
7 | 2215114424664200 |
oct | 240272163607144 |
9 | 43014744245275 |
10 | 11020111122020 |
11 | 356966a486610 |
12 | 129b930b01658 |
13 | 61c265b37960 |
14 | 2a153a505b00 |
15 | 1419d2075365 |
hex | a05d1cf0e64 |
11020111122020 has 144 divisors (see below), whose sum is σ = 31626948685248. Its totient is φ = 3170621341440.
The previous prime is 11020111121993. The next prime is 11020111122061. The reversal of 11020111122020 is 2022111102011.
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 = 11020111121986 and 11020111122004.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 39178082 + ... + 39458361.
It is an arithmetic number, because the mean of its divisors is an integer number (219631588092).
Almost surely, 211020111122020 is an apocalyptic number.
11020111122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020111122020 is an abundant number, since it is smaller than the sum of its proper divisors (20606837563228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020111122020 is a wasteful number, since it uses less digits than its factorization.
11020111122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78636490 (or 78636481 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11020111122020 its reverse (2022111102011), we get a palindrome (13042222224031).
The spelling of 11020111122020 in words is "eleven trillion, twenty billion, one hundred eleven million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •