Base | Representation |
---|---|
bin | 101101100001100111011101… |
… | …110101000011111101010011 |
3 | 222020221001112012220221210110 |
4 | 231201213131311003331103 |
5 | 202220420042300042321 |
6 | 1545500451530132403 |
7 | 60113402032152252 |
oct | 5541473565037523 |
9 | 866831465827713 |
10 | 200222212112211 |
11 | 58884843a56183 |
12 | 1a5584a5881103 |
13 | 8794b48368403 |
14 | 3762b41adc799 |
15 | 182338c590176 |
hex | b619ddd43f53 |
200222212112211 has 8 divisors (see below), whose sum is σ = 267101057586640. Its totient is φ = 133412420689632.
The previous prime is 200222212112183. The next prime is 200222212112269. The reversal of 200222212112211 is 112211212222002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200222212112211 - 217 = 200222211981139 is a prime.
It is a super-3 number, since 3×2002222121122113 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200222212132211) 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, 17263506196 + ... + 17263517793.
It is an arithmetic number, because the mean of its divisors is an integer number (33387632198330).
Almost surely, 2200222212112211 is an apocalyptic number.
200222212112211 is a deficient number, since it is larger than the sum of its proper divisors (66878845474429).
200222212112211 is a wasteful number, since it uses less digits than its factorization.
200222212112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34527025925.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 200222212112211 its reverse (112211212222002), we get a palindrome (312433424334213).
The spelling of 200222212112211 in words is "two hundred trillion, two hundred twenty-two billion, two hundred twelve million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •