Base | Representation |
---|---|
bin | 1011111110000101011… |
… | …0000111001010010101 |
3 | 201122210200201100102212 |
4 | 2333201112013022111 |
5 | 11332124344224023 |
6 | 234245511243205 |
7 | 20600024201204 |
oct | 2774126071225 |
9 | 648720640385 |
10 | 205644133013 |
11 | 7a23882a940 |
12 | 33a31979505 |
13 | 16513759457 |
14 | 9d4b93723b |
15 | 5538c14e78 |
hex | 2fe1587295 |
205644133013 has 4 divisors (see below), whose sum is σ = 224339054208. Its totient is φ = 186949211820.
The previous prime is 205644133007. The next prime is 205644133033. The reversal of 205644133013 is 310331446502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 205644133013 - 228 = 205375697557 is a prime.
It is a super-3 number, since 3×2056441330133 (a number of 35 digits) contains 333 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 (205644133033) 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, 9347460581 + ... + 9347460602.
It is an arithmetic number, because the mean of its divisors is an integer number (56084763552).
Almost surely, 2205644133013 is an apocalyptic number.
It is an amenable number.
205644133013 is a deficient number, since it is larger than the sum of its proper divisors (18694921195).
205644133013 is a wasteful number, since it uses less digits than its factorization.
205644133013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18694921194.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 205644133013 its reverse (310331446502), we get a palindrome (515975579515).
The spelling of 205644133013 in words is "two hundred five billion, six hundred forty-four million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •