Base | Representation |
---|---|
bin | 1011111000101111111… |
… | …1011000010001000000 |
3 | 201112002220010001201022 |
4 | 2332023333120101000 |
5 | 11321211300013100 |
6 | 233451434125012 |
7 | 20516365204154 |
oct | 2761377302100 |
9 | 645086101638 |
10 | 204212110400 |
11 | 7967345a081 |
12 | 336b2280768 |
13 | 16345b781ac |
14 | 9c5368b064 |
15 | 54a3146e85 |
hex | 2f8bfd8440 |
204212110400 has 84 divisors (see below), whose sum is σ = 507099851940. Its totient is φ = 80935372800.
The previous prime is 204212110391. The next prime is 204212110429. The reversal of 204212110400 is 4011212402.
204212110400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 3106501696 + 201105608704 = 55736^2 + 448448^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 411071 + ... + 759870.
Almost surely, 2204212110400 is an apocalyptic number.
204212110400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204212110400 is an abundant number, since it is smaller than the sum of its proper divisors (302887741540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204212110400 is a wasteful number, since it uses less digits than its factorization.
204212110400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171072 (or 1171057 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 204212110400 its reverse (4011212402), we get a palindrome (208223322802).
The spelling of 204212110400 in words is "two hundred four billion, two hundred twelve million, one hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •