Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …1100001111100011101 |
3 | 201010210200200002012122 |
4 | 2322132003201330131 |
5 | 11240022334034323 |
6 | 231551354112325 |
7 | 20315433541235 |
oct | 2723603417435 |
9 | 633720602178 |
10 | 200220221213 |
11 | 77a05105701 |
12 | 3297941b6a5 |
13 | 15b5ab3649c |
14 | 9995448cc5 |
15 | 531c974ec8 |
hex | 2e9e0e1f1d |
200220221213 has 4 divisors (see below), whose sum is σ = 200222637888. Its totient is φ = 200217804540.
The previous prime is 200220221183. The next prime is 200220221221. The reversal of 200220221213 is 312122022002.
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 200220221213 - 28 = 200220220957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200220221191 and 200220221200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200220221233) 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, 1079483 + ... + 1251288.
It is an arithmetic number, because the mean of its divisors is an integer number (50055659472).
Almost surely, 2200220221213 is an apocalyptic number.
It is an amenable number.
200220221213 is a deficient number, since it is larger than the sum of its proper divisors (2416675).
200220221213 is an equidigital number, since it uses as much as digits as its factorization.
200220221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2416674.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 200220221213 its reverse (312122022002), we get a palindrome (512342243215).
The spelling of 200220221213 in words is "two hundred billion, two hundred twenty million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •