Base | Representation |
---|---|
bin | 101101011111110101110110… |
… | …101010001011100000111001 |
3 | 222020111101122112020100222101 |
4 | 231133311312222023200321 |
5 | 202211420223330401131 |
6 | 1545324434545223401 |
7 | 60101523020305243 |
oct | 5537656652134071 |
9 | 866441575210871 |
10 | 200100222122041 |
11 | 58838033870a8a |
12 | 1a53891b631b61 |
13 | 87864a6accb87 |
14 | 375ac8c385093 |
15 | 18200eca52c61 |
hex | b5fd76a8b839 |
200100222122041 has 2 divisors, whose sum is σ = 200100222122042. Its totient is φ = 200100222122040.
The previous prime is 200100222122039. The next prime is 200100222122161. The reversal of 200100222122041 is 140221222001002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140455184201641 + 59645037920400 = 11851379^2 + 7723020^2 .
It is a cyclic number.
It is not a de Polignac number, because 200100222122041 - 21 = 200100222122039 is a prime.
Together with 200100222122039, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (200100222123041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050111061020 + 100050111061021.
It is an arithmetic number, because the mean of its divisors is an integer number (100050111061021).
Almost surely, 2200100222122041 is an apocalyptic number.
It is an amenable number.
200100222122041 is a deficient number, since it is larger than the sum of its proper divisors (1).
200100222122041 is an equidigital number, since it uses as much as digits as its factorization.
200100222122041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 200100222122041 its reverse (140221222001002), we get a palindrome (340321444123043).
The spelling of 200100222122041 in words is "two hundred trillion, one hundred billion, two hundred twenty-two million, one hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •