Base | Representation |
---|---|
bin | 1011111000101110000… |
… | …0011111011001001101 |
3 | 201112002022212200100112 |
4 | 2332023200133121031 |
5 | 11321202211410013 |
6 | 233450544405405 |
7 | 20516236321031 |
oct | 2761340373115 |
9 | 645068780315 |
10 | 204204013133 |
11 | 7966992951a |
12 | 336ab616865 |
13 | 163442a1703 |
14 | 9c525801c1 |
15 | 54a2597ba8 |
hex | 2f8b81f64d |
204204013133 has 4 divisors (see below), whose sum is σ = 204925582368. Its totient is φ = 203482443900.
The previous prime is 204204013129. The next prime is 204204013151. The reversal of 204204013133 is 331310402402.
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 204204013133 - 22 = 204204013129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 204204013099 and 204204013108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204204043133) 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, 360784193 + ... + 360784758.
It is an arithmetic number, because the mean of its divisors is an integer number (51231395592).
Almost surely, 2204204013133 is an apocalyptic number.
It is an amenable number.
204204013133 is a deficient number, since it is larger than the sum of its proper divisors (721569235).
204204013133 is an equidigital number, since it uses as much as digits as its factorization.
204204013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 721569234.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 204204013133 its reverse (331310402402), we get a palindrome (535514415535).
The spelling of 204204013133 in words is "two hundred four billion, two hundred four million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •