Base | Representation |
---|---|
bin | 1011111001111011110… |
… | …0001010001010111101 |
3 | 201112221001100020000001 |
4 | 2332132330022022331 |
5 | 11322334142031331 |
6 | 233543152234301 |
7 | 20530305412204 |
oct | 2763674121275 |
9 | 645831306001 |
10 | 204530033341 |
11 | 79816965307 |
12 | 3378083b991 |
13 | 163969acb8a |
14 | 9c839a823b |
15 | 54c0ee6561 |
hex | 2f9ef0a2bd |
204530033341 has 4 divisors (see below), whose sum is σ = 211127776384. Its totient is φ = 197932290300.
The previous prime is 204530033317. The next prime is 204530033363. The reversal of 204530033341 is 143330035402.
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 204530033341 - 233 = 195940098749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204530033041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3298871475 + ... + 3298871536.
It is an arithmetic number, because the mean of its divisors is an integer number (52781944096).
Almost surely, 2204530033341 is an apocalyptic number.
It is an amenable number.
204530033341 is a deficient number, since it is larger than the sum of its proper divisors (6597743043).
204530033341 is an equidigital number, since it uses as much as digits as its factorization.
204530033341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6597743042.
The product of its (nonzero) digits is 12960, while the sum is 28.
Adding to 204530033341 its reverse (143330035402), we get a palindrome (347860068743).
The spelling of 204530033341 in words is "two hundred four billion, five hundred thirty million, thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •