Base | Representation |
---|---|
bin | 101101100001010010111111… |
… | …000100000000110010100101 |
3 | 222020211221202121221211220221 |
4 | 231201102333010000302211 |
5 | 202220040023100214341 |
6 | 1545442413434324341 |
7 | 60111663052512505 |
oct | 5541227704006245 |
9 | 866757677854827 |
10 | 200200221101221 |
11 | 5887648966a130 |
12 | 1a554188b896b1 |
13 | 8792a52342a83 |
14 | 3761a5721ba05 |
15 | 1822a01b39ed1 |
hex | b614bf100ca5 |
200200221101221 has 16 divisors (see below), whose sum is σ = 223758097190208. Its totient is φ = 177536551996800.
The previous prime is 200200221101191. The next prime is 200200221101263. The reversal of 200200221101221 is 122101122002002.
It is a happy number.
It is not a de Polignac number, because 200200221101221 - 29 = 200200221100709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200200221101195 and 200200221101204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200221101291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27517971 + ... + 34024096.
It is an arithmetic number, because the mean of its divisors is an integer number (13984881074388).
Almost surely, 2200200221101221 is an apocalyptic number.
It is an amenable number.
200200221101221 is a deficient number, since it is larger than the sum of its proper divisors (23557876088987).
200200221101221 is a wasteful number, since it uses less digits than its factorization.
200200221101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61549332.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200200221101221 its reverse (122101122002002), we get a palindrome (322301343103223).
The spelling of 200200221101221 in words is "two hundred trillion, two hundred billion, two hundred twenty-one million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •