Base | Representation |
---|---|
bin | 101110011100111110001001… |
… | …111110011001001010100111 |
3 | 222210100222122122110201020002 |
4 | 232130332021332121022213 |
5 | 203234231444144002211 |
6 | 2002302332252531515 |
7 | 61014155555661161 |
oct | 5634761176311247 |
9 | 883328578421202 |
10 | 204301024203431 |
11 | 5a10763a056431 |
12 | 1aab6aa7780b9b |
13 | 89cc672148b3c |
14 | 3864318113931 |
15 | 18945125bb03b |
hex | b9cf89f992a7 |
204301024203431 has 2 divisors, whose sum is σ = 204301024203432. Its totient is φ = 204301024203430.
The previous prime is 204301024203379. The next prime is 204301024203449. The reversal of 204301024203431 is 134302420103402.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 204301024203431 - 222 = 204301020009127 is a prime.
It is a super-2 number, since 2×2043010242034312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 204301024203394 and 204301024203403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (204301024203491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102150512101715 + 102150512101716.
It is an arithmetic number, because the mean of its divisors is an integer number (102150512101716).
Almost surely, 2204301024203431 is an apocalyptic number.
204301024203431 is a deficient number, since it is larger than the sum of its proper divisors (1).
204301024203431 is an equidigital number, since it uses as much as digits as its factorization.
204301024203431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 204301024203431 its reverse (134302420103402), we get a palindrome (338603444306833).
The spelling of 204301024203431 in words is "two hundred four trillion, three hundred one billion, twenty-four million, two hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •