Base | Representation |
---|---|
bin | 1100110011111111000… |
… | …1000000010110100000 |
3 | 210001011001201020001001 |
4 | 3030333301000112200 |
5 | 12101242431040300 |
6 | 245041340321344 |
7 | 21621415563316 |
oct | 3147761002640 |
9 | 701131636031 |
10 | 220113143200 |
11 | 853931493a5 |
12 | 367ab543254 |
13 | 179ab28ca42 |
14 | a92141a0b6 |
15 | 5ad40de16a |
hex | 333fc405a0 |
220113143200 has 72 divisors (see below), whose sum is σ = 540079268652. Its totient is φ = 87598264320.
The previous prime is 220113143191. The next prime is 220113143207. The reversal of 220113143200 is 2341311022.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 93971676304 + 126141466896 = 306548^2 + 355164^2 .
It is not an unprimeable number, because it can be changed into a prime (220113143207) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 540729 + ... + 855928.
Almost surely, 2220113143200 is an apocalyptic number.
220113143200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220113143200 is an abundant number, since it is smaller than the sum of its proper divisors (319966125452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220113143200 is a wasteful number, since it uses less digits than its factorization.
220113143200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1396874 (or 1396861 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 220113143200 its reverse (2341311022), we get a palindrome (222454454222).
The spelling of 220113143200 in words is "two hundred twenty billion, one hundred thirteen million, one hundred forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •