Base | Representation |
---|---|
bin | 1011111001011101110… |
… | …0001110000010001010 |
3 | 201112121021121020121020 |
4 | 2332113130032002022 |
5 | 11322104440020132 |
6 | 233522455453310 |
7 | 20524220126451 |
oct | 2762734160212 |
9 | 645537536536 |
10 | 204404220042 |
11 | 79761942980 |
12 | 33746687236 |
13 | 163768cbc39 |
14 | 9c70db7b98 |
15 | 54b4e4352c |
hex | 2f9770e08a |
204404220042 has 32 divisors (see below), whose sum is σ = 446251633344. Its totient is φ = 61901952000.
The previous prime is 204404220029. The next prime is 204404220071. The reversal of 204404220042 is 240022404402.
204404220042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 204404219994 and 204404220021.
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 15 ways as a sum of consecutive naturals, for example, 861553 + ... + 1072884.
It is an arithmetic number, because the mean of its divisors is an integer number (13945363542).
Almost surely, 2204404220042 is an apocalyptic number.
204404220042 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
204404220042 is an abundant number, since it is smaller than the sum of its proper divisors (241847413302).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204404220042 is a wasteful number, since it uses less digits than its factorization.
204404220042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1936054.
The product of its (nonzero) digits is 4096, while the sum is 24.
Adding to 204404220042 its reverse (240022404402), we get a palindrome (444426624444).
The spelling of 204404220042 in words is "two hundred four billion, four hundred four million, two hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •