Base | Representation |
---|---|
bin | 1011111000011000000… |
… | …1111111001111010111 |
3 | 201111211220222120210201 |
4 | 2332012001333033113 |
5 | 11321010201143111 |
6 | 233433503201331 |
7 | 20514042326134 |
oct | 2760601771727 |
9 | 644756876721 |
10 | 204112131031 |
11 | 79621a820a6 |
12 | 336848a6247 |
13 | 1632b240bc3 |
14 | 9c442a358b |
15 | 54994986c1 |
hex | 2f8607f3d7 |
204112131031 has 4 divisors (see below), whose sum is σ = 216118726992. Its totient is φ = 192105535072.
The previous prime is 204112130993. The next prime is 204112131061. The reversal of 204112131031 is 130131211402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 204112131031 - 27 = 204112130903 is a prime.
It is a super-2 number, since 2×2041121310312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204112131061) 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 3 ways as a sum of consecutive naturals, for example, 6003297955 + ... + 6003297988.
It is an arithmetic number, because the mean of its divisors is an integer number (54029681748).
Almost surely, 2204112131031 is an apocalyptic number.
204112131031 is a deficient number, since it is larger than the sum of its proper divisors (12006595961).
204112131031 is a wasteful number, since it uses less digits than its factorization.
204112131031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12006595960.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 204112131031 its reverse (130131211402), we get a palindrome (334243342433).
The spelling of 204112131031 in words is "two hundred four billion, one hundred twelve million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •