Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …011011000011101000110111 |
3 | 222020212222120200210212101122 |
4 | 231201131001123003220313 |
5 | 202220224111004133441 |
6 | 1545451355055214155 |
7 | 60112524113563412 |
oct | 5541350133035067 |
9 | 866788520725348 |
10 | 200210998114871 |
11 | 58880009a44a87 |
12 | 1a55629621735b |
13 | 8793a7bcc5623 |
14 | 376239a644b79 |
15 | 1822e32d2e34b |
hex | b617416c3a37 |
200210998114871 has 2 divisors, whose sum is σ = 200210998114872. Its totient is φ = 200210998114870.
The previous prime is 200210998114783. The next prime is 200210998114877. The reversal of 200210998114871 is 178411899012002.
It is a happy number.
200210998114871 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 200210998114871 - 230 = 200209924373047 is a prime.
It is a super-2 number, since 2×2002109981148712 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210998114877) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105499057435 + 100105499057436.
It is an arithmetic number, because the mean of its divisors is an integer number (100105499057436).
Almost surely, 2200210998114871 is an apocalyptic number.
200210998114871 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210998114871 is an equidigital number, since it uses as much as digits as its factorization.
200210998114871 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 580608, while the sum is 53.
The spelling of 200210998114871 in words is "two hundred trillion, two hundred ten billion, nine hundred ninety-eight million, one hundred fourteen thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •