Base | Representation |
---|---|
bin | 1011101001001000110… |
… | …0010111011111101001 |
3 | 201010021211012022200012 |
4 | 2322102030113133221 |
5 | 11234120412223423 |
6 | 231515524421305 |
7 | 20310466145663 |
oct | 2722214273751 |
9 | 633254168605 |
10 | 200021211113 |
11 | 77912839449 |
12 | 32922847835 |
13 | 15b28837929 |
14 | 9976c43533 |
15 | 530a264078 |
hex | 2e923177e9 |
200021211113 has 2 divisors, whose sum is σ = 200021211114. Its totient is φ = 200021211112.
The previous prime is 200021211079. The next prime is 200021211127. The reversal of 200021211113 is 311112120002.
It is an a-pointer prime, because the next prime (200021211127) can be obtained adding 200021211113 to its sum of digits (14).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138523162969 + 61498048144 = 372187^2 + 247988^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200021211113 is a prime.
It is a super-2 number, since 2×2000212111132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200021211133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100010605556 + 100010605557.
It is an arithmetic number, because the mean of its divisors is an integer number (100010605557).
Almost surely, 2200021211113 is an apocalyptic number.
It is an amenable number.
200021211113 is a deficient number, since it is larger than the sum of its proper divisors (1).
200021211113 is an equidigital number, since it uses as much as digits as its factorization.
200021211113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200021211113 its reverse (311112120002), we get a palindrome (511133331115).
The spelling of 200021211113 in words is "two hundred billion, twenty-one million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •