Base | Representation |
---|---|
bin | 1011110000111011010… |
… | …0100001001001100100 |
3 | 201022200112121001101022 |
4 | 2330032310201021210 |
5 | 11302411200024304 |
6 | 232503215550312 |
7 | 20413345412423 |
oct | 2741664411144 |
9 | 638615531338 |
10 | 202112111204 |
11 | 78796021653 |
12 | 33206b2b398 |
13 | 1609ca8a813 |
14 | 9ad48012ba |
15 | 53cdaceebe |
hex | 2f0ed21264 |
202112111204 has 12 divisors (see below), whose sum is σ = 363255551484. Its totient is φ = 98324810784.
The previous prime is 202112111197. The next prime is 202112111207. The reversal of 202112111204 is 402111211202.
202112111204 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 93818464804 + 108293646400 = 306298^2 + 329080^2 .
It is not an unprimeable number, because it can be changed into a prime (202112111207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 682811039 + ... + 682811334.
It is an arithmetic number, because the mean of its divisors is an integer number (30271295957).
Almost surely, 2202112111204 is an apocalyptic number.
It is an amenable number.
202112111204 is a deficient number, since it is larger than the sum of its proper divisors (161143440280).
202112111204 is a wasteful number, since it uses less digits than its factorization.
202112111204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365622414 (or 1365622412 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202112111204 its reverse (402111211202), we get a palindrome (604223322406).
The spelling of 202112111204 in words is "two hundred two billion, one hundred twelve million, one hundred eleven thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •