Base | Representation |
---|---|
bin | 111011100111011… |
… | …110011110111111 |
3 | 2120201001122020212 |
4 | 323213132132333 |
5 | 4022023013343 |
6 | 243125503035 |
7 | 33533411204 |
oct | 7347363677 |
9 | 2521048225 |
10 | 1000204223 |
11 | 473653267 |
12 | 23ab71a7b |
13 | 12c2ac125 |
14 | 96ba1cab |
15 | 5cc21c18 |
hex | 3b9de7bf |
1000204223 has 2 divisors, whose sum is σ = 1000204224. Its totient is φ = 1000204222.
The previous prime is 1000204201. The next prime is 1000204237. The reversal of 1000204223 is 3224020001.
It is an a-pointer prime, because the next prime (1000204237) can be obtained adding 1000204223 to its sum of digits (14).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1000204223 - 212 = 1000200127 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000204198 and 1000204207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000206223) 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, 500102111 + 500102112.
It is an arithmetic number, because the mean of its divisors is an integer number (500102112).
Almost surely, 21000204223 is an apocalyptic number.
1000204223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000204223 is an equidigital number, since it uses as much as digits as its factorization.
1000204223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 14.
The square root of 1000204223 is about 31626.0054859921. The cubic root of 1000204223 is about 1000.0680696997.
Adding to 1000204223 its reverse (3224020001), we get a palindrome (4224224224).
The spelling of 1000204223 in words is "one billion, two hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •