Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001001011100001101 |
3 | 222020212222120220021120112021 |
4 | 231201131001212021130031 |
5 | 202220224112230202341 |
6 | 1545451355241410141 |
7 | 60112524150362560 |
oct | 5541350146113415 |
9 | 866788526246467 |
10 | 200211001022221 |
11 | 58880010650352 |
12 | 1a556297199951 |
13 | 8793a7c7a2a57 |
14 | 376239aba04d7 |
15 | 1822e332059d1 |
hex | b6174198970d |
200211001022221 has 32 divisors (see below), whose sum is σ = 230932089158400. Its totient is φ = 170027448053760.
The previous prime is 200211001022209. The next prime is 200211001022239. The reversal of 200211001022221 is 122220100112002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200211001022221 - 29 = 200211001021709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200211001022195 and 200211001022204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001022251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1079625135 + ... + 1079810563.
It is an arithmetic number, because the mean of its divisors is an integer number (7216627786200).
Almost surely, 2200211001022221 is an apocalyptic number.
It is an amenable number.
200211001022221 is a deficient number, since it is larger than the sum of its proper divisors (30721088136179).
200211001022221 is a wasteful number, since it uses less digits than its factorization.
200211001022221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188869.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200211001022221 its reverse (122220100112002), we get a palindrome (322431101134223).
The spelling of 200211001022221 in words is "two hundred trillion, two hundred eleven billion, one million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •