Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …0110110010000010111 |
3 | 201010210200022222201212 |
4 | 2322132002312100113 |
5 | 11240022312323023 |
6 | 231551350212035 |
7 | 20315432164433 |
oct | 2723602662027 |
9 | 633720288655 |
10 | 200220042263 |
11 | 77a04aa320a |
12 | 3297935401b |
13 | 15b5aaa2bb7 |
14 | 99953dd9c3 |
15 | 531c93be78 |
hex | 2e9e0b6417 |
200220042263 has 2 divisors, whose sum is σ = 200220042264. Its totient is φ = 200220042262.
The previous prime is 200220042227. The next prime is 200220042289. The reversal of 200220042263 is 362240022002.
200220042263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200220042263 - 28 = 200220042007 is a prime.
It is a super-2 number, since 2×2002200422632 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200220044263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110021131 + 100110021132.
It is an arithmetic number, because the mean of its divisors is an integer number (100110021132).
Almost surely, 2200220042263 is an apocalyptic number.
200220042263 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220042263 is an equidigital number, since it uses as much as digits as its factorization.
200220042263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 200220042263 its reverse (362240022002), we get a palindrome (562460064265).
The spelling of 200220042263 in words is "two hundred billion, two hundred twenty million, forty-two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •