Base | Representation |
---|---|
bin | 10100100001111100… |
… | …00001111011000100 |
3 | 1001110011001102121222 |
4 | 22100332001323010 |
5 | 140033130131000 |
6 | 5021414055512 |
7 | 540065266415 |
oct | 122076017304 |
9 | 31404042558 |
10 | 11022114500 |
11 | 4746772841 |
12 | 217734a598 |
13 | 106869b357 |
14 | 767bc980c |
15 | 4479aba85 |
hex | 290f81ec4 |
11022114500 has 48 divisors (see below), whose sum is σ = 24480368640. Its totient is φ = 4334108000.
The previous prime is 11022114497. The next prime is 11022114503. The reversal of 11022114500 is 541122011.
It is an interprime number because it is at equal distance from previous prime (11022114497) and next prime (11022114503).
It is a super-2 number, since 2×110221145002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11022114503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157316 + ... + 216315.
It is an arithmetic number, because the mean of its divisors is an integer number (510007680).
Almost surely, 211022114500 is an apocalyptic number.
11022114500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11022114500 is an abundant number, since it is smaller than the sum of its proper divisors (13458254140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022114500 is a wasteful number, since it uses less digits than its factorization.
11022114500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373709 (or 373697 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 11022114500 its reverse (541122011), we get a palindrome (11563236511).
The spelling of 11022114500 in words is "eleven billion, twenty-two million, one hundred fourteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •