Base | Representation |
---|---|
bin | 1011111001001111001… |
… | …1000110111000110111 |
3 | 201112110000121121001122 |
4 | 2332103303012320313 |
5 | 11321443314024343 |
6 | 233512434014155 |
7 | 20522545533566 |
oct | 2762363067067 |
9 | 645400547048 |
10 | 204343111223 |
11 | 797303a4a19 |
12 | 3372a11735b |
13 | 16367054384 |
14 | 9c66c2bbdd |
15 | 54ae8c2068 |
hex | 2f93cc6e37 |
204343111223 has 2 divisors, whose sum is σ = 204343111224. Its totient is φ = 204343111222.
The previous prime is 204343111201. The next prime is 204343111241. The reversal of 204343111223 is 322111343402.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 204343111223 - 220 = 204342062647 is a prime.
It is a super-2 number, since 2×2043431112232 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 204343111192 and 204343111201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (204343114223) 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 as a sum of consecutive naturals, namely, 102171555611 + 102171555612.
It is an arithmetic number, because the mean of its divisors is an integer number (102171555612).
Almost surely, 2204343111223 is an apocalyptic number.
204343111223 is a deficient number, since it is larger than the sum of its proper divisors (1).
204343111223 is an equidigital number, since it uses as much as digits as its factorization.
204343111223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 204343111223 its reverse (322111343402), we get a palindrome (526454454625).
The spelling of 204343111223 in words is "two hundred four billion, three hundred forty-three million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •