Base | Representation |
---|---|
bin | 101110011110011101010100… |
… | …111001111000001001111100 |
3 | 222210201202102100210120221001 |
4 | 232132131110321320021330 |
5 | 203242420240014323200 |
6 | 2002421312330220044 |
7 | 61024434111532126 |
oct | 5636352471701174 |
9 | 883652370716831 |
10 | 204403213042300 |
11 | 5a146a08a88578 |
12 | 1ab12866584624 |
13 | 8a091a927c9bc |
14 | 386924db48216 |
15 | 1896ee3a6a76a |
hex | b9e754e7827c |
204403213042300 has 36 divisors (see below), whose sum is σ = 443724982439760. Its totient is φ = 81729946942720.
The previous prime is 204403213042283. The next prime is 204403213042307. The reversal of 204403213042300 is 3240312304402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204403213042307) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 391466224 + ... + 391988023.
It is an arithmetic number, because the mean of its divisors is an integer number (12325693956660).
Almost surely, 2204403213042300 is an apocalyptic number.
204403213042300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204403213042300 is an abundant number, since it is smaller than the sum of its proper divisors (239321769397460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204403213042300 is a wasteful number, since it uses less digits than its factorization.
204403213042300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783456870 (or 783456863 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 204403213042300 its reverse (3240312304402), we get a palindrome (207643525346702).
The spelling of 204403213042300 in words is "two hundred four trillion, four hundred three billion, two hundred thirteen million, forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •