Base | Representation |
---|---|
bin | 10100101011001110… |
… | …010100101000110000 |
3 | 2010022011020102102012 |
4 | 110223032110220300 |
5 | 330431200330222 |
6 | 14110515142052 |
7 | 1414064661023 |
oct | 245316245060 |
9 | 63264212365 |
10 | 22200011312 |
11 | 9462367096 |
12 | 43768a4928 |
13 | 212a41148b |
14 | 11085671ba |
15 | 89de8b1e2 |
hex | 52b394a30 |
22200011312 has 80 divisors (see below), whose sum is σ = 46374219360. Its totient is φ = 10263822336.
The previous prime is 22200011311. The next prime is 22200011329. The reversal of 22200011312 is 21311000222.
It is a happy number.
It is a super-2 number, since 2×222000113122 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22200011311) 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, 2147468 + ... + 2157780.
It is an arithmetic number, because the mean of its divisors is an integer number (579677742).
Almost surely, 222200011312 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 22200011312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23187109680).
22200011312 is an abundant number, since it is smaller than the sum of its proper divisors (24174208048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22200011312 is a wasteful number, since it uses less digits than its factorization.
22200011312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10510 (or 10504 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 22200011312 its reverse (21311000222), we get a palindrome (43511011534).
The spelling of 22200011312 in words is "twenty-two billion, two hundred million, eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •