Base | Representation |
---|---|
bin | 1011101001011110011… |
… | …1100010100000111101 |
3 | 201010112011110001200220 |
4 | 2322113213202200331 |
5 | 11234312212021341 |
6 | 231532535211553 |
7 | 20312652543444 |
oct | 2722747424075 |
9 | 633464401626 |
10 | 200112220221 |
11 | 7795a149991 |
12 | 32949216bb9 |
13 | 15b41650c84 |
14 | 9984d73d5b |
15 | 531323ea66 |
hex | 2e979e283d |
200112220221 has 8 divisors (see below), whose sum is σ = 266861137920. Its totient is φ = 133385724672.
The previous prime is 200112220201. The next prime is 200112220229. The reversal of 200112220221 is 122022211002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200112220221 - 26 = 200112220157 is a prime.
It is a super-4 number, since 4×2001122202214 (a number of 46 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200112220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200112220229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5584701 + ... + 5620418.
It is an arithmetic number, because the mean of its divisors is an integer number (33357642240).
Almost surely, 2200112220221 is an apocalyptic number.
It is an amenable number.
200112220221 is a deficient number, since it is larger than the sum of its proper divisors (66748917699).
200112220221 is a wasteful number, since it uses less digits than its factorization.
200112220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11211075.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200112220221 its reverse (122022211002), we get a palindrome (322134431223).
The spelling of 200112220221 in words is "two hundred billion, one hundred twelve million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •