Base | Representation |
---|---|
bin | 11001011110000110111100… |
… | …010011001101100110001011 |
3 | 112200122000201102111220212011 |
4 | 121132012330103031212023 |
5 | 104140314333001400021 |
6 | 1034125211530400351 |
7 | 32411123004424516 |
oct | 3136067423154613 |
9 | 480560642456764 |
10 | 112020201200011 |
11 | 327695562425a5 |
12 | 106923228900b7 |
13 | 4a675c8ac7a00 |
14 | 1d93b416cbd7d |
15 | ce3d80e50de1 |
hex | 65e1bc4cd98b |
112020201200011 has 48 divisors (see below), whose sum is σ = 123906998592000. Its totient is φ = 101191283496576.
The previous prime is 112020201199999. The next prime is 112020201200263. The reversal of 112020201200011 is 110002102020211.
It is not a de Polignac number, because 112020201200011 - 239 = 111470445386123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 112020201199964 and 112020201200000.
It is not an unprimeable number, because it can be changed into a prime (112020201230011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5686583440 + ... + 5686603138.
It is an arithmetic number, because the mean of its divisors is an integer number (2581395804000).
Almost surely, 2112020201200011 is an apocalyptic number.
112020201200011 is a deficient number, since it is larger than the sum of its proper divisors (11886797391989).
112020201200011 is a wasteful number, since it uses less digits than its factorization.
112020201200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21380 (or 21367 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112020201200011 its reverse (110002102020211), we get a palindrome (222022303220222).
The spelling of 112020201200011 in words is "one hundred twelve trillion, twenty billion, two hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •