Base | Representation |
---|---|
bin | 1100110011111101101… |
… | …0011111110111111000 |
3 | 210001010122121110111010 |
4 | 3030333122133313320 |
5 | 12101234423234000 |
6 | 245041010033520 |
7 | 21621314460501 |
oct | 3147732376770 |
9 | 701118543433 |
10 | 220107243000 |
11 | 8538a8894a7 |
12 | 367a95788a0 |
13 | 179a9ca52b8 |
14 | a920721ba8 |
15 | 5ad3825d50 |
hex | 333f69fdf8 |
220107243000 has 128 divisors (see below), whose sum is σ = 689735592000. Its totient is φ = 58438771200.
The previous prime is 220107242939. The next prime is 220107243053. The reversal of 220107243000 is 342701022.
It is a super-2 number, since 2×2201072430002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 526806 + ... + 847194.
Almost surely, 2220107243000 is an apocalyptic number.
220107243000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 220107243000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (344867796000).
220107243000 is an abundant number, since it is smaller than the sum of its proper divisors (469628349000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220107243000 is a wasteful number, since it uses less digits than its factorization.
220107243000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320642 (or 320628 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 21.
Adding to 220107243000 its reverse (342701022), we get a palindrome (220449944022).
The spelling of 220107243000 in words is "two hundred twenty billion, one hundred seven million, two hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •