Base | Representation |
---|---|
bin | 101101011110101101000110… |
… | …010010100000110101011101 |
3 | 222020012221000010221100122120 |
4 | 231132231012102200311131 |
5 | 202204130230401401341 |
6 | 1545224515034533153 |
7 | 60063056063364546 |
oct | 5536550622406535 |
9 | 866187003840576 |
10 | 200022101200221 |
11 | 58807995620183 |
12 | 1a525758b971b9 |
13 | 877c007084a51 |
14 | 375719adc94cd |
15 | 181d07950d066 |
hex | b5eb464a0d5d |
200022101200221 has 8 divisors (see below), whose sum is σ = 266700583296864. Its totient is φ = 133345843285200.
The previous prime is 200022101200193. The next prime is 200022101200237. The reversal of 200022101200221 is 122002101220002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200022101200221 - 213 = 200022101192029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200022101200221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022101200121) 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, 555835555 + ... + 556195296.
It is an arithmetic number, because the mean of its divisors is an integer number (33337572912108).
Almost surely, 2200022101200221 is an apocalyptic number.
It is an amenable number.
200022101200221 is a deficient number, since it is larger than the sum of its proper divisors (66678482096643).
200022101200221 is a wasteful number, since it uses less digits than its factorization.
200022101200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112090811.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200022101200221 its reverse (122002101220002), we get a palindrome (322024202420223).
The spelling of 200022101200221 in words is "two hundred trillion, twenty-two billion, one hundred one million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •