Base | Representation |
---|---|
bin | 1011110111111110000… |
… | …0000001111110001111 |
3 | 201111120021211002212202 |
4 | 2331333200001332033 |
5 | 11320244124103111 |
6 | 233414550552115 |
7 | 20511242125505 |
oct | 2757740017617 |
9 | 644507732782 |
10 | 204002566031 |
11 | 79576148310 |
12 | 3365406863b |
13 | 1631162b844 |
14 | 9c33902675 |
15 | 548ea54b3b |
hex | 2f7f801f8f |
204002566031 has 16 divisors (see below), whose sum is σ = 235828260000. Its totient is φ = 174407700480.
The previous prime is 204002566013. The next prime is 204002566039. The reversal of 204002566031 is 130665200402.
It is a cyclic number.
It is not a de Polignac number, because 204002566031 - 222 = 203998371727 is a prime.
It is a super-2 number, since 2×2040025660312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204002565985 and 204002566003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204002566039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 203156 + ... + 670281.
It is an arithmetic number, because the mean of its divisors is an integer number (14739266250).
Almost surely, 2204002566031 is an apocalyptic number.
204002566031 is a deficient number, since it is larger than the sum of its proper divisors (31825693969).
204002566031 is a wasteful number, since it uses less digits than its factorization.
204002566031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874714.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 204002566031 its reverse (130665200402), we get a palindrome (334667766433).
The spelling of 204002566031 in words is "two hundred four billion, two million, five hundred sixty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •