Base | Representation |
---|---|
bin | 1011101001001000100… |
… | …0001010101110100000 |
3 | 201010021202010101120010 |
4 | 2322102020022232200 |
5 | 11234120122011430 |
6 | 231515445044520 |
7 | 20310453612306 |
oct | 2722210125640 |
9 | 633252111503 |
10 | 200020110240 |
11 | 77912157335 |
12 | 329223b6740 |
13 | 15b28540822 |
14 | 9976a38276 |
15 | 530a0e7cb0 |
hex | 2e9220aba0 |
200020110240 has 192 divisors, whose sum is σ = 641478942720. Its totient is φ = 52374389760.
The previous prime is 200020110233. The next prime is 200020110281. The reversal of 200020110240 is 42011020002.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 28061557 + ... + 28068683.
It is an arithmetic number, because the mean of its divisors is an integer number (3341036160).
Almost surely, 2200020110240 is an apocalyptic number.
200020110240 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 200020110240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (320739471360).
200020110240 is an abundant number, since it is smaller than the sum of its proper divisors (441458832480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200020110240 is a wasteful number, since it uses less digits than its factorization.
200020110240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8195 (or 8187 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 200020110240 its reverse (42011020002), we get a palindrome (242031130242).
The spelling of 200020110240 in words is "two hundred billion, twenty million, one hundred ten thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •