Base | Representation |
---|---|
bin | 1011101100110111001… |
… | …1000100010111010000 |
3 | 201012212111212122011020 |
4 | 2323031303010113100 |
5 | 11243142412241422 |
6 | 232203050115440 |
7 | 20344331052540 |
oct | 2731563042720 |
9 | 635774778136 |
10 | 201021212112 |
11 | 78286262a56 |
12 | 32b6171bb80 |
13 | 15c57a753b6 |
14 | 9a2d991320 |
15 | 5367e4595c |
hex | 2ecdcc45d0 |
201021212112 has 40 divisors (see below), whose sum is σ = 593491198656. Its totient is φ = 57434631936.
The previous prime is 201021212101. The next prime is 201021212167. The reversal of 201021212112 is 211212120102.
201021212112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201021212091 and 201021212100.
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 7 ways as a sum of consecutive naturals, for example, 299138373 + ... + 299139044.
Almost surely, 2201021212112 is an apocalyptic number.
It is an amenable number.
201021212112 is an abundant number, since it is smaller than the sum of its proper divisors (392469986544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201021212112 is a wasteful number, since it uses less digits than its factorization.
201021212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598277435 (or 598277429 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201021212112 its reverse (211212120102), we get a palindrome (412233332214).
The spelling of 201021212112 in words is "two hundred one billion, twenty-one million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •