Base | Representation |
---|---|
bin | 10100100001111011… |
… | …01000011100000000 |
3 | 1001110010212010102202 |
4 | 22100331220130000 |
5 | 140033113310422 |
6 | 5021411532332 |
7 | 540064353161 |
oct | 122075503400 |
9 | 31403763382 |
10 | 11022010112 |
11 | 4746701373 |
12 | 21772ba0a8 |
13 | 1068662999 |
14 | 767b9d768 |
15 | 44798ab92 |
hex | 290f68700 |
11022010112 has 72 divisors (see below), whose sum is σ = 23351808816. Its totient is φ = 5174214656.
The previous prime is 11022010081. The next prime is 11022010123. The reversal of 11022010112 is 21101022011.
It is a junction number, because it is equal to n+sod(n) for n = 11022010093 and 11022010102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1925078 + ... + 1930794.
It is an arithmetic number, because the mean of its divisors is an integer number (324330678).
Almost surely, 211022010112 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 11022010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11675904408).
11022010112 is an abundant number, since it is smaller than the sum of its proper divisors (12329798704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022010112 is an equidigital number, since it uses as much as digits as its factorization.
11022010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6193 (or 6179 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11022010112 its reverse (21101022011), we get a palindrome (32123032123).
The spelling of 11022010112 in words is "eleven billion, twenty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •