Base | Representation |
---|---|
bin | 1011111000011010010… |
… | …0101111111010111001 |
3 | 201111212120010112111221 |
4 | 2332012210233322321 |
5 | 11321020014241241 |
6 | 233434430352041 |
7 | 20514212640442 |
oct | 2760644577271 |
9 | 644776115457 |
10 | 204121243321 |
11 | 79627136316 |
12 | 3368795b621 |
13 | 163300b16a8 |
14 | 9c455962c9 |
15 | 549a1985d1 |
hex | 2f8692feb9 |
204121243321 has 4 divisors (see below), whose sum is σ = 204213733632. Its totient is φ = 204028753012.
The previous prime is 204121243301. The next prime is 204121243349. The reversal of 204121243321 is 123342121402.
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 a de Polignac number, because none of the positive numbers 2k-204121243321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204121243301) 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, 46241845 + ... + 46246258.
It is an arithmetic number, because the mean of its divisors is an integer number (51053433408).
Almost surely, 2204121243321 is an apocalyptic number.
It is an amenable number.
204121243321 is a deficient number, since it is larger than the sum of its proper divisors (92490311).
204121243321 is an equidigital number, since it uses as much as digits as its factorization.
204121243321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92490310.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 204121243321 its reverse (123342121402), we get a palindrome (327463364723).
The spelling of 204121243321 in words is "two hundred four billion, one hundred twenty-one million, two hundred forty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •