Base | Representation |
---|---|
bin | 101101011110101011010110… |
… | …001110100010011111000101 |
3 | 222020012202011010012220000022 |
4 | 231132223112032202133011 |
5 | 202204112403101011323 |
6 | 1545224004314024525 |
7 | 60062661354030560 |
oct | 5536532616423705 |
9 | 866182133186008 |
10 | 200020221110213 |
11 | 58807110333789 |
12 | 1a525313418145 |
13 | 877ba9770265a |
14 | 375705d4254d7 |
15 | 181ceb94344c8 |
hex | b5ead63a27c5 |
200020221110213 has 16 divisors (see below), whose sum is σ = 228955621476096. Its totient is φ = 171175101941760.
The previous prime is 200020221110159. The next prime is 200020221110273. The reversal of 200020221110213 is 312011122020002.
It is not a de Polignac number, because 200020221110213 - 220 = 200020220061637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200020221110191 and 200020221110200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200020221110273) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 245359520 + ... + 246173382.
It is an arithmetic number, because the mean of its divisors is an integer number (14309726342256).
Almost surely, 2200020221110213 is an apocalyptic number.
It is an amenable number.
200020221110213 is a deficient number, since it is larger than the sum of its proper divisors (28935400365883).
200020221110213 is an equidigital number, since it uses as much as digits as its factorization.
200020221110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869284.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 200020221110213 its reverse (312011122020002), we get a palindrome (512031343130215).
The spelling of 200020221110213 in words is "two hundred trillion, twenty billion, two hundred twenty-one million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •