Base | Representation |
---|---|
bin | 101101100001010011111010… |
… | …001000011000000011111111 |
3 | 222020212001022200200211212101 |
4 | 231201103322020120003333 |
5 | 202220044040244211423 |
6 | 1545443100035045531 |
7 | 60112026445046341 |
oct | 5541237210300377 |
9 | 866761280624771 |
10 | 200201212100863 |
11 | 58876947aa58a6 |
12 | 1a554404a408a7 |
13 | 8792b7c74b3ac |
14 | 3761b0caa5291 |
15 | 1822a5db3e7ad |
hex | b614fa2180ff |
200201212100863 has 2 divisors, whose sum is σ = 200201212100864. Its totient is φ = 200201212100862.
The previous prime is 200201212100861. The next prime is 200201212100909. The reversal of 200201212100863 is 368001212102002.
200201212100863 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200201212100863 - 21 = 200201212100861 is a prime.
Together with 200201212100861, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200201212100861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100100606050431 + 100100606050432.
It is an arithmetic number, because the mean of its divisors is an integer number (100100606050432).
Almost surely, 2200201212100863 is an apocalyptic number.
200201212100863 is a deficient number, since it is larger than the sum of its proper divisors (1).
200201212100863 is an equidigital number, since it uses as much as digits as its factorization.
200201212100863 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 200201212100863 its reverse (368001212102002), we get a palindrome (568202424202865).
The spelling of 200201212100863 in words is "two hundred trillion, two hundred one billion, two hundred twelve million, one hundred thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •