Base | Representation |
---|---|
bin | 10101000100100111… |
… | …01111110100111100 |
3 | 1002012102102222020220 |
4 | 22202103233310330 |
5 | 141132113121340 |
6 | 5110325141340 |
7 | 550230041145 |
oct | 124223576474 |
9 | 32172388226 |
10 | 11313020220 |
11 | 48859a5597 |
12 | 223885a850 |
13 | 10b3a33908 |
14 | 7946b2acc |
15 | 4632c0ed0 |
hex | 2a24efd3c |
11313020220 has 24 divisors (see below), whose sum is σ = 31676456784. Its totient is φ = 3016805376.
The previous prime is 11313020219. The next prime is 11313020239. The reversal of 11313020220 is 2202031311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11313020220.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 94275109 + ... + 94275228.
It is an arithmetic number, because the mean of its divisors is an integer number (1319852366).
Almost surely, 211313020220 is an apocalyptic number.
11313020220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11313020220 is an abundant number, since it is smaller than the sum of its proper divisors (20363436564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11313020220 is a wasteful number, since it uses less digits than its factorization.
11313020220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188550349 (or 188550347 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11313020220 its reverse (2202031311), we get a palindrome (13515051531).
The spelling of 11313020220 in words is "eleven billion, three hundred thirteen million, twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •