Base | Representation |
---|---|
bin | 101110101001000111001110… |
… | …111001010011110100010101 |
3 | 222220022202100000112220102012 |
4 | 232221013032321103310111 |
5 | 203341414301430413013 |
6 | 2004141523110554005 |
7 | 61131354355354505 |
oct | 5651071671236425 |
9 | 886282300486365 |
10 | 205135404154133 |
11 | 5a3a9488859a22 |
12 | 1b010747968905 |
13 | 8a60254a208bb |
14 | 389286c49da05 |
15 | 18ab098cb01a8 |
hex | ba91cee53d15 |
205135404154133 has 2 divisors, whose sum is σ = 205135404154134. Its totient is φ = 205135404154132.
The previous prime is 205135404154099. The next prime is 205135404154159. The reversal of 205135404154133 is 331451404531502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 179994476104804 + 25140928049329 = 13416202^2 + 5014073^2 .
It is a cyclic number.
It is not a de Polignac number, because 205135404154133 - 26 = 205135404154069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205135404154193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102567702077066 + 102567702077067.
It is an arithmetic number, because the mean of its divisors is an integer number (102567702077067).
Almost surely, 2205135404154133 is an apocalyptic number.
It is an amenable number.
205135404154133 is a deficient number, since it is larger than the sum of its proper divisors (1).
205135404154133 is an equidigital number, since it uses as much as digits as its factorization.
205135404154133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 205135404154133 its reverse (331451404531502), we get a palindrome (536586808685635).
The spelling of 205135404154133 in words is "two hundred five trillion, one hundred thirty-five billion, four hundred four million, one hundred fifty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •