Base | Representation |
---|---|
bin | 1011111001010000001… |
… | …0001001010001010100 |
3 | 201112110022000212100120 |
4 | 2332110002021101110 |
5 | 11322000321200030 |
6 | 233513054311540 |
7 | 20522624202216 |
oct | 2762402112124 |
9 | 645408025316 |
10 | 204347053140 |
11 | 797326475aa |
12 | 3372b4b85b0 |
13 | 16367b04679 |
14 | 9c675765b6 |
15 | 54aee00010 |
hex | 2f94089454 |
204347053140 has 96 divisors (see below), whose sum is σ = 602663053440. Its totient is φ = 51592204800.
The previous prime is 204347053133. The next prime is 204347053177. The reversal of 204347053140 is 41350743402.
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, 1792650 + ... + 1903230.
It is an arithmetic number, because the mean of its divisors is an integer number (6277740140).
Almost surely, 2204347053140 is an apocalyptic number.
204347053140 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 204347053140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (301331526720).
204347053140 is an abundant number, since it is smaller than the sum of its proper divisors (398316000300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204347053140 is a wasteful number, since it uses less digits than its factorization.
204347053140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112233 (or 112231 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 33.
Adding to 204347053140 its reverse (41350743402), we get a palindrome (245697796542).
The spelling of 204347053140 in words is "two hundred four billion, three hundred forty-seven million, fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •