Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …101010101110000111010011 |
3 | 222020212222120222112110221220 |
4 | 231201131001222232013103 |
5 | 202220224113032033021 |
6 | 1545451355323220123 |
7 | 60112524163514565 |
oct | 5541350152560723 |
9 | 866788528473856 |
10 | 200211002221011 |
11 | 58880011299a91 |
12 | 1a556297677643 |
13 | 8793a7cb025b2 |
14 | 376239add3335 |
15 | 1822e33390cc6 |
hex | b61741aae1d3 |
200211002221011 has 8 divisors (see below), whose sum is σ = 266949064704000. Its totient is φ = 133473470609352.
The previous prime is 200211002220953. The next prime is 200211002221031. The reversal of 200211002221011 is 110122200112002.
200211002221011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200211002221011 - 211 = 200211002218963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200211002221031) 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, 131837011 + ... + 133346988.
It is an arithmetic number, because the mean of its divisors is an integer number (33368633088000).
Almost surely, 2200211002221011 is an apocalyptic number.
200211002221011 is a deficient number, since it is larger than the sum of its proper divisors (66738062482989).
200211002221011 is a wasteful number, since it uses less digits than its factorization.
200211002221011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 265435665.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200211002221011 its reverse (110122200112002), we get a palindrome (310333202333013).
The spelling of 200211002221011 in words is "two hundred trillion, two hundred eleven billion, two million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •