Base | Representation |
---|---|
bin | 1011101001001000100… |
… | …0001101101001100011 |
3 | 201010021202010222222111 |
4 | 2322102020031221203 |
5 | 11234120122402321 |
6 | 231515445220151 |
7 | 20310453662230 |
oct | 2722210155143 |
9 | 633252128874 |
10 | 200020122211 |
11 | 77912165328 |
12 | 32922401657 |
13 | 15b28546100 |
14 | 9976a3c787 |
15 | 530a0eb5e1 |
hex | 2e9220da63 |
200020122211 has 24 divisors (see below), whose sum is σ = 247890476544. Its totient is φ = 158028006240.
The previous prime is 200020122209. The next prime is 200020122223. The reversal of 200020122211 is 112221020002.
It is a happy number.
It is not a de Polignac number, because 200020122211 - 21 = 200020122209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200020122191 and 200020122200.
It is not an unprimeable number, because it can be changed into a prime (200020122241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 695110 + ... + 939796.
It is an arithmetic number, because the mean of its divisors is an integer number (10328769856).
Almost surely, 2200020122211 is an apocalyptic number.
200020122211 is a deficient number, since it is larger than the sum of its proper divisors (47870354333).
200020122211 is a wasteful number, since it uses less digits than its factorization.
200020122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245411 (or 245398 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200020122211 its reverse (112221020002), we get a palindrome (312241142213).
The spelling of 200020122211 in words is "two hundred billion, twenty million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •