Base | Representation |
---|---|
bin | 101101100011000100100110… |
… | …110010000100101000011000 |
3 | 222021021121122221222221120020 |
4 | 231203010212302010220120 |
5 | 202224034401400004422 |
6 | 1550014431345030440 |
7 | 60123542235635142 |
oct | 5543044662045030 |
9 | 867247587887506 |
10 | 200322220313112 |
11 | 589131a3a82787 |
12 | 1a573956325420 |
13 | 87a13c5789851 |
14 | 376790bc95c92 |
15 | 1825c9239995c |
hex | b63126c84a18 |
200322220313112 has 64 divisors (see below), whose sum is σ = 528875846311680. Its totient is φ = 63101324491392.
The previous prime is 200322220312933. The next prime is 200322220313143. The reversal of 200322220313112 is 211313022223002.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2186114263 + ... + 2186205894.
It is an arithmetic number, because the mean of its divisors is an integer number (8263685098620).
Almost surely, 2200322220313112 is an apocalyptic number.
It is an amenable number.
200322220313112 is an abundant number, since it is smaller than the sum of its proper divisors (328553625998568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200322220313112 is a wasteful number, since it uses less digits than its factorization.
200322220313112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4372320272 (or 4372320268 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 200322220313112 its reverse (211313022223002), we get a palindrome (411635242536114).
The spelling of 200322220313112 in words is "two hundred trillion, three hundred twenty-two billion, two hundred twenty million, three hundred thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •