Base | Representation |
---|---|
bin | 1011101011000010001… |
… | …0100110000001000000 |
3 | 201011121022020110202001 |
4 | 2322300202212001000 |
5 | 11241141232313430 |
6 | 232042233233344 |
7 | 20326220613166 |
oct | 2726042460100 |
9 | 634538213661 |
10 | 200530354240 |
11 | 78054180197 |
12 | 32a45262854 |
13 | 15baa171558 |
14 | 99c46d9236 |
15 | 5339cd63ca |
hex | 2eb08a6040 |
200530354240 has 28 divisors (see below), whose sum is σ = 477512906796. Its totient is φ = 80212141568.
The previous prime is 200530354163. The next prime is 200530354259. The reversal of 200530354240 is 42453035002.
It can be written as a sum of positive squares in 2 ways, for example, as 63073308736 + 137457045504 = 251144^2 + 370752^2 .
It is a junction number, because it is equal to n+sod(n) for n = 200530354199 and 200530354208.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 313328359 + ... + 313328998.
Almost surely, 2200530354240 is an apocalyptic number.
200530354240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200530354240 is an abundant number, since it is smaller than the sum of its proper divisors (276982552556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200530354240 is an equidigital number, since it uses as much as digits as its factorization.
200530354240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626657374 (or 626657364 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 28.
Adding to 200530354240 its reverse (42453035002), we get a palindrome (242983389242).
The spelling of 200530354240 in words is "two hundred billion, five hundred thirty million, three hundred fifty-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •