Base | Representation |
---|---|
bin | 101110011010101000001100… |
… | …011000000000110000000011 |
3 | 222202210121000211001012211101 |
4 | 232122220030120000300003 |
5 | 203224112211304400003 |
6 | 2002100342305555231 |
7 | 60666425404015453 |
oct | 5632501430006003 |
9 | 882717024035741 |
10 | 204140003200003 |
11 | 5a05531a984292 |
12 | 1aa8b84a045b17 |
13 | 89ba4204c9ca0 |
14 | 385a600b85d63 |
15 | 189023b19e11d |
hex | b9aa0c600c03 |
204140003200003 has 32 divisors (see below), whose sum is σ = 231841323705600. Its totient is φ = 178189398688896.
The previous prime is 204140003199973. The next prime is 204140003200009. The reversal of 204140003200003 is 300002300041402.
It is a cyclic number.
It is not a de Polignac number, because 204140003200003 - 229 = 204139466329091 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204140003200009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4823361000 + ... + 4823403322.
It is an arithmetic number, because the mean of its divisors is an integer number (7245041365800).
Almost surely, 2204140003200003 is an apocalyptic number.
204140003200003 is a deficient number, since it is larger than the sum of its proper divisors (27701320505597).
204140003200003 is a wasteful number, since it uses less digits than its factorization.
204140003200003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77971.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 204140003200003 its reverse (300002300041402), we get a palindrome (504142303241405).
The spelling of 204140003200003 in words is "two hundred four trillion, one hundred forty billion, three million, two hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •