Base | Representation |
---|---|
bin | 11001011101110110001011… |
… | …111100001110110010001011 |
3 | 112200120022021120220021011102 |
4 | 121131312023330032302023 |
5 | 104140021011230000021 |
6 | 1034113034400452015 |
7 | 32406615113643422 |
oct | 3135661374166213 |
9 | 480508246807142 |
10 | 112002210000011 |
11 | 32761963720771 |
12 | 1068a94161a00b |
13 | 4a659bc658a36 |
14 | 1d92d161122b9 |
15 | ce367b73500b |
hex | 65dd8bf0ec8b |
112002210000011 has 8 divisors (see below), whose sum is σ = 113159425862784. Its totient is φ = 110845046257920.
The previous prime is 112002209999987. The next prime is 112002210000047. The reversal of 112002210000011 is 110000012200211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112002210000011 - 218 = 112002209737867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112002209999947 and 112002210000001.
It is not an unprimeable number, because it can be changed into a prime (112002210000071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8702780 + ... + 17313081.
It is an arithmetic number, because the mean of its divisors is an integer number (14144928232848).
Almost surely, 2112002210000011 is an apocalyptic number.
112002210000011 is a deficient number, since it is larger than the sum of its proper divisors (1157215862773).
112002210000011 is an equidigital number, since it uses as much as digits as its factorization.
112002210000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26060341.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112002210000011 its reverse (110000012200211), we get a palindrome (222002222200222).
The spelling of 112002210000011 in words is "one hundred twelve trillion, two billion, two hundred ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •