Base | Representation |
---|---|
bin | 10100111001100011… |
… | …01111110001010100 |
3 | 1001221221211021200012 |
4 | 22130301233301110 |
5 | 140434334033022 |
6 | 5053212135352 |
7 | 545022206420 |
oct | 123461576124 |
9 | 31857737605 |
10 | 11220221012 |
11 | 4838582130 |
12 | 2211767558 |
13 | 109a741840 |
14 | 786237b80 |
15 | 45a08ede2 |
hex | 29cc6fc54 |
11220221012 has 96 divisors (see below), whose sum is σ = 27751342080. Its totient is φ = 3822837120.
The previous prime is 11220220981. The next prime is 11220221059. The reversal of 11220221012 is 21012202211.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2333 + ... + 149819.
It is an arithmetic number, because the mean of its divisors is an integer number (289076480).
Almost surely, 211220221012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11220221012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13875671040).
11220221012 is an abundant number, since it is smaller than the sum of its proper divisors (16531121068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220221012 is a wasteful number, since it uses less digits than its factorization.
11220221012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147541 (or 147539 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11220221012 its reverse (21012202211), we get a palindrome (32232423223).
It can be divided in two parts, 11220 and 221012, that added together give a palindrome (232232).
The spelling of 11220221012 in words is "eleven billion, two hundred twenty million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •