Base | Representation |
---|---|
bin | 1011101001001000111… |
… | …1110000110001000111 |
3 | 201010021212212112110022 |
4 | 2322102033300301013 |
5 | 11234121124213223 |
6 | 231515555445355 |
7 | 20310506543411 |
oct | 2722217606107 |
9 | 633255775408 |
10 | 200022101063 |
11 | 77913297044 |
12 | 32922bb685b |
13 | 15b28a89a25 |
14 | 9976dd59b1 |
15 | 530a38cac8 |
hex | 2e923f0c47 |
200022101063 has 2 divisors, whose sum is σ = 200022101064. Its totient is φ = 200022101062.
The previous prime is 200022101033. The next prime is 200022101089. The reversal of 200022101063 is 360101220002.
200022101063 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 200022101063 - 210 = 200022100039 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200022101033) 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, 100011050531 + 100011050532.
It is an arithmetic number, because the mean of its divisors is an integer number (100011050532).
Almost surely, 2200022101063 is an apocalyptic number.
200022101063 is a deficient number, since it is larger than the sum of its proper divisors (1).
200022101063 is an equidigital number, since it uses as much as digits as its factorization.
200022101063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 200022101063 its reverse (360101220002), we get a palindrome (560123321065).
The spelling of 200022101063 in words is "two hundred billion, twenty-two million, one hundred one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •