Base | Representation |
---|---|
bin | 1011111001111100000… |
… | …1100010011000101010 |
3 | 201112221010222212000121 |
4 | 2332133001202120222 |
5 | 11322340022140432 |
6 | 233543242353454 |
7 | 20530323403540 |
oct | 2763701423052 |
9 | 645833885017 |
10 | 204531443242 |
11 | 79817738615 |
12 | 337811bb88a |
13 | 16397084839 |
14 | 9c83c53d90 |
15 | 54c11c4197 |
hex | 2f9f06262a |
204531443242 has 8 divisors (see below), whose sum is σ = 350625331296. Its totient is φ = 87656332812.
The previous prime is 204531443209. The next prime is 204531443251. The reversal of 204531443242 is 242344135402.
204531443242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2045314432422 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 204531443198 and 204531443207.
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 3 ways as a sum of consecutive naturals, for example, 7304694388 + ... + 7304694415.
It is an arithmetic number, because the mean of its divisors is an integer number (43828166412).
Almost surely, 2204531443242 is an apocalyptic number.
204531443242 is a deficient number, since it is larger than the sum of its proper divisors (146093888054).
204531443242 is a wasteful number, since it uses less digits than its factorization.
204531443242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14609388812.
The product of its (nonzero) digits is 92160, while the sum is 34.
Adding to 204531443242 its reverse (242344135402), we get a palindrome (446875578644).
The spelling of 204531443242 in words is "two hundred four billion, five hundred thirty-one million, four hundred forty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •