Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …100101000110000011100001 |
3 | 222020220211211202110201021111 |
4 | 231201211122211012003201 |
5 | 202220401040042024301 |
6 | 1545455445225423321 |
7 | 60113263333360243 |
oct | 5541453245060341 |
9 | 866824752421244 |
10 | 200220010111201 |
11 | 58883913a8a233 |
12 | 1a557b9033ab41 |
13 | 87948870b6032 |
14 | 37629b34a0093 |
15 | 18232ae0ca551 |
hex | b6195a9460e1 |
200220010111201 has 16 divisors (see below), whose sum is σ = 207920023874640. Its totient is φ = 192654299335680.
The previous prime is 200220010111153. The next prime is 200220010111207. The reversal of 200220010111201 is 102111010022002.
It can be written as a sum of positive squares in 8 ways, for example, as 13120043065600 + 187099967045601 = 3622160^2 + 13678449^2 .
It is a cyclic number.
It is not a de Polignac number, because 200220010111201 - 29 = 200220010110689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200220010111207) 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, 89490091 + ... + 91700143.
It is an arithmetic number, because the mean of its divisors is an integer number (12995001492165).
Almost surely, 2200220010111201 is an apocalyptic number.
It is an amenable number.
200220010111201 is a deficient number, since it is larger than the sum of its proper divisors (7700013763439).
200220010111201 is a wasteful number, since it uses less digits than its factorization.
200220010111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2240436.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200220010111201 its reverse (102111010022002), we get a palindrome (302331020133203).
The spelling of 200220010111201 in words is "two hundred trillion, two hundred twenty billion, ten million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •