Base | Representation |
---|---|
bin | 10100101011111000… |
… | …010010001011111000 |
3 | 2010022220221021120220 |
4 | 110223320102023320 |
5 | 330442004330240 |
6 | 14111551020040 |
7 | 1414260324021 |
oct | 245370221370 |
9 | 63286837526 |
10 | 22211011320 |
11 | 946859a603 |
12 | 437a50a620 |
13 | 212c793264 |
14 | 1109bcbc48 |
15 | 89ee105d0 |
hex | 52be122f8 |
22211011320 has 64 divisors (see below), whose sum is σ = 66654990720. Its totient is φ = 5920984704.
The previous prime is 22211011271. The next prime is 22211011349. The reversal of 22211011320 is 2311011222.
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 22211011320.
It is a congruent number.
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, 355467 + ... + 413253.
It is an arithmetic number, because the mean of its divisors is an integer number (1041484230).
Almost surely, 222211011320 is an apocalyptic number.
22211011320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22211011320 is an abundant number, since it is smaller than the sum of its proper divisors (44443979400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22211011320 is a wasteful number, since it uses less digits than its factorization.
22211011320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61004 (or 61000 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 22211011320 its reverse (2311011222), we get a palindrome (24522022542).
The spelling of 22211011320 in words is "twenty-two billion, two hundred eleven million, eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •