Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110000110100000100101 |
3 | 222020212222120220020222001112 |
4 | 231201131001212012200211 |
5 | 202220224112224311323 |
6 | 1545451355241234405 |
7 | 60112524150312554 |
oct | 5541350146064045 |
9 | 866788526228045 |
10 | 200211001010213 |
11 | 58880010642326 |
12 | 1a556297192a05 |
13 | 8793a7c79a44b |
14 | 376239ab99d9b |
15 | 1822e33202178 |
hex | b61741986825 |
200211001010213 has 4 divisors (see below), whose sum is σ = 200213277283680. Its totient is φ = 200208724736748.
The previous prime is 200211001010201. The next prime is 200211001010233. The reversal of 200211001010213 is 312010100112002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200211001010213 - 216 = 200211000944677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001010233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1138004795 + ... + 1138180712.
It is an arithmetic number, because the mean of its divisors is an integer number (50053319320920).
Almost surely, 2200211001010213 is an apocalyptic number.
It is an amenable number.
200211001010213 is a deficient number, since it is larger than the sum of its proper divisors (2276273467).
200211001010213 is an equidigital number, since it uses as much as digits as its factorization.
200211001010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2276273466.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200211001010213 its reverse (312010100112002), we get a palindrome (512221101122215).
The spelling of 200211001010213 in words is "two hundred trillion, two hundred eleven billion, one million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •