Base | Representation |
---|---|
bin | 1011111001100110011… |
… | …0101000100001101111 |
3 | 201112200210212200102111 |
4 | 2332121212220201233 |
5 | 11322143232120211 |
6 | 233530233304451 |
7 | 20525140421032 |
oct | 2763146504157 |
9 | 645623780374 |
10 | 204440504431 |
11 | 79780375979 |
12 | 33756865127 |
13 | 163812944a7 |
14 | 9c75b41019 |
15 | 54b820e421 |
hex | 2f999a886f |
204440504431 has 4 divisors (see below), whose sum is σ = 215200531000. Its totient is φ = 193680477864.
The previous prime is 204440504413. The next prime is 204440504453. The reversal of 204440504431 is 134405044402.
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 204440504431 - 227 = 204306286703 is a prime.
It is a super-2 number, since 2×2044405044312 (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 = 204440504393 and 204440504402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204440504461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5380013256 + ... + 5380013293.
It is an arithmetic number, because the mean of its divisors is an integer number (53800132750).
Almost surely, 2204440504431 is an apocalyptic number.
204440504431 is a deficient number, since it is larger than the sum of its proper divisors (10760026569).
204440504431 is a wasteful number, since it uses less digits than its factorization.
204440504431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10760026568.
The product of its (nonzero) digits is 30720, while the sum is 31.
Adding to 204440504431 its reverse (134405044402), we get a palindrome (338845548833).
The spelling of 204440504431 in words is "two hundred four billion, four hundred forty million, five hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •