Base | Representation |
---|---|
bin | 1011101101100010110… |
… | …1001010000110010000 |
3 | 201020100021012222222000 |
4 | 2323120231022012100 |
5 | 11244031234241422 |
6 | 232233144314000 |
7 | 20352012404331 |
oct | 2733055120620 |
9 | 636307188860 |
10 | 201204212112 |
11 | 7836a594622 |
12 | 32bb2a72900 |
13 | 15c86959917 |
14 | 9a49dca288 |
15 | 5379042cac |
hex | 2ed8b4a190 |
201204212112 has 80 divisors (see below), whose sum is σ = 583248860160. Its totient is φ = 66404016000.
The previous prime is 201204212107. The next prime is 201204212189. The reversal of 201204212112 is 211212402102.
201204212112 is a `hidden beast` number, since 20 + 12 + 0 + 421 + 211 + 2 = 666.
It is a super-2 number, since 2×2012042121122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2262064 + ... + 2349327.
It is an arithmetic number, because the mean of its divisors is an integer number (7290610752).
Almost surely, 2201204212112 is an apocalyptic number.
It is an amenable number.
201204212112 is an abundant number, since it is smaller than the sum of its proper divisors (382044648048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201204212112 is a wasteful number, since it uses less digits than its factorization.
201204212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4611509 (or 4611497 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 201204212112 its reverse (211212402102), we get a palindrome (412416614214).
The spelling of 201204212112 in words is "two hundred one billion, two hundred four million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •