Base | Representation |
---|---|
bin | 10100100000110110… |
… | …10011111011100100 |
3 | 1001102111221001000112 |
4 | 22100123103323210 |
5 | 140023312410340 |
6 | 5020451032152 |
7 | 536625032156 |
oct | 122033237344 |
9 | 31374831015 |
10 | 11013013220 |
11 | 4741616920 |
12 | 217429b658 |
13 | 1066832891 |
14 | 7668daad6 |
15 | 446cb0065 |
hex | 2906d3ee4 |
11013013220 has 48 divisors (see below), whose sum is σ = 25253121600. Its totient is φ = 4001032320.
The previous prime is 11013013213. The next prime is 11013013247. The reversal of 11013013220 is 2231031011.
11013013220 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11013013195 and 11013013204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221411 + ... + 266549.
It is an arithmetic number, because the mean of its divisors is an integer number (526106700).
Almost surely, 211013013220 is an apocalyptic number.
11013013220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11013013220 is an abundant number, since it is smaller than the sum of its proper divisors (14240108380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013013220 is a wasteful number, since it uses less digits than its factorization.
11013013220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46268 (or 46266 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 11013013220 its reverse (2231031011), we get a palindrome (13244044231).
The spelling of 11013013220 in words is "eleven billion, thirteen million, thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •