Base | Representation |
---|---|
bin | 11001011101110111000010… |
… | …110001110000101100100011 |
3 | 112200120101122201001012220222 |
4 | 121131313002301300230203 |
5 | 104140024402240032321 |
6 | 1034113305543353255 |
7 | 32406646654560530 |
oct | 3135670261605443 |
9 | 480511581035828 |
10 | 112003130002211 |
11 | 32762295a74a68 |
12 | 1068ab5975282b |
13 | 4a65b08136836 |
14 | 1d92da2397d87 |
15 | ce36d23b33ab |
hex | 65ddc2c70b23 |
112003130002211 has 16 divisors (see below), whose sum is σ = 128363670042624. Its totient is φ = 95732659288224.
The previous prime is 112003130002207. The next prime is 112003130002213. The reversal of 112003130002211 is 112200031300211.
It is not a de Polignac number, because 112003130002211 - 22 = 112003130002207 is a prime.
It is a super-2 number, since 2×1120031300022112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112003130002211.
It is not an unprimeable number, because it can be changed into a prime (112003130002213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27327881 + ... + 31157973.
It is an arithmetic number, because the mean of its divisors is an integer number (8022729377664).
Almost surely, 2112003130002211 is an apocalyptic number.
112003130002211 is a deficient number, since it is larger than the sum of its proper divisors (16360540040413).
112003130002211 is a wasteful number, since it uses less digits than its factorization.
112003130002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3841850.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 112003130002211 its reverse (112200031300211), we get a palindrome (224203161302422).
The spelling of 112003130002211 in words is "one hundred twelve trillion, three billion, one hundred thirty million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •