Base | Representation |
---|---|
bin | 101101011111110111100010… |
… | …100110100001100101110111 |
3 | 222020111120022201220202010111 |
4 | 231133313202212201211313 |
5 | 202211432430433300343 |
6 | 1545325334401003451 |
7 | 60101615630346616 |
oct | 5537674246414567 |
9 | 866446281822114 |
10 | 200102033103223 |
11 | 58838883045a49 |
12 | 1a539146023587 |
13 | 8786705066284 |
14 | 375adc0ab987d |
15 | 18201a6a29c9d |
hex | b5fde29a1977 |
200102033103223 has 2 divisors, whose sum is σ = 200102033103224. Its totient is φ = 200102033103222.
The previous prime is 200102033103187. The next prime is 200102033103229. The reversal of 200102033103223 is 322301330201002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200102033103223 - 221 = 200102031006071 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200102033103194 and 200102033103203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200102033103229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100051016551611 + 100051016551612.
It is an arithmetic number, because the mean of its divisors is an integer number (100051016551612).
Almost surely, 2200102033103223 is an apocalyptic number.
200102033103223 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102033103223 is an equidigital number, since it uses as much as digits as its factorization.
200102033103223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 200102033103223 its reverse (322301330201002), we get a palindrome (522403363304225).
The spelling of 200102033103223 in words is "two hundred trillion, one hundred two billion, thirty-three million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •