Base | Representation |
---|---|
bin | 1010000110001110111011… |
… | …0000101000110001111100 |
3 | 1110022100201111021121000221 |
4 | 2201203232300220301330 |
5 | 2423344302003021340 |
6 | 35340140354231124 |
7 | 2224051616212435 |
oct | 241435660506174 |
9 | 43270644247027 |
10 | 11102201220220 |
11 | 35a0465178380 |
12 | 12b38208854a4 |
13 | 626c18ca1666 |
14 | 2a54c6ab048c |
15 | 143bd8ca244a |
hex | a18eec28c7c |
11102201220220 has 24 divisors (see below), whose sum is σ = 25434133705008. Its totient is φ = 4037164080000.
The previous prime is 11102201220197. The next prime is 11102201220239. The reversal of 11102201220220 is 2202210220111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11102201220194 and 11102201220203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25232275281 + ... + 25232275720.
It is an arithmetic number, because the mean of its divisors is an integer number (1059755571042).
Almost surely, 211102201220220 is an apocalyptic number.
11102201220220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102201220220 is an abundant number, since it is smaller than the sum of its proper divisors (14331932484788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102201220220 is a wasteful number, since it uses less digits than its factorization.
11102201220220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50464551021 (or 50464551019 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11102201220220 its reverse (2202210220111), we get a palindrome (13304411440331).
The spelling of 11102201220220 in words is "eleven trillion, one hundred two billion, two hundred one million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •