Base | Representation |
---|---|
bin | 101101100001010010111111… |
… | …000010000101101011000011 |
3 | 222020211221202121000020011112 |
4 | 231201102333002011223003 |
5 | 202220040022433100211 |
6 | 1545442413415433535 |
7 | 60111663045312332 |
oct | 5541227702055303 |
9 | 866757677006145 |
10 | 200200220596931 |
11 | 58876489355265 |
12 | 1a5541889858ab |
13 | 8792a521c7389 |
14 | 3761a57129d19 |
15 | 1822a01a8a88b |
hex | b614bf085ac3 |
200200220596931 has 2 divisors, whose sum is σ = 200200220596932. Its totient is φ = 200200220596930.
The previous prime is 200200220596927. The next prime is 200200220596997. The reversal of 200200220596931 is 139695022002002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200200220596931 - 22 = 200200220596927 is a prime.
It is a super-2 number, since 2×2002002205969312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200200220596331) 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, 100100110298465 + 100100110298466.
It is an arithmetic number, because the mean of its divisors is an integer number (100100110298466).
Almost surely, 2200200220596931 is an apocalyptic number.
200200220596931 is a deficient number, since it is larger than the sum of its proper divisors (1).
200200220596931 is an equidigital number, since it uses as much as digits as its factorization.
200200220596931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 41.
Adding to 200200220596931 its reverse (139695022002002), we get a palindrome (339895242598933).
The spelling of 200200220596931 in words is "two hundred trillion, two hundred billion, two hundred twenty million, five hundred ninety-six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •