Base | Representation |
---|---|
bin | 1011111001011011100… |
… | …1001000001111101100 |
3 | 201112120122021220021210 |
4 | 2332112321020033230 |
5 | 11322100111140132 |
6 | 233521530354420 |
7 | 20524046005110 |
oct | 2762671101754 |
9 | 645518256253 |
10 | 204395021292 |
11 | 7975772a800 |
12 | 3374358ba10 |
13 | 16374a2aca7 |
14 | 9c6daa1740 |
15 | 54b4227bcc |
hex | 2f96e483ec |
204395021292 has 144 divisors (see below), whose sum is σ = 601754307840. Its totient is φ = 52855144320.
The previous prime is 204395021269. The next prime is 204395021381. The reversal of 204395021292 is 292120593402.
It is a self number, because there is not a number n which added to its sum of digits gives 204395021292.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2262934 + ... + 2351522.
It is an arithmetic number, because the mean of its divisors is an integer number (4178849360).
Almost surely, 2204395021292 is an apocalyptic number.
204395021292 is a gapful number since it is divisible by the number (22) 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 204395021292, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300877153920).
204395021292 is an abundant number, since it is smaller than the sum of its proper divisors (397359286548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204395021292 is a wasteful number, since it uses less digits than its factorization.
204395021292 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88852 (or 88839 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 39.
The spelling of 204395021292 in words is "two hundred four billion, three hundred ninety-five million, twenty-one thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •