Base | Representation |
---|---|
bin | 11001011101110111000010… |
… | …110110011101001101011001 |
3 | 112200120101122210100202101221 |
4 | 121131313002312131031121 |
5 | 104140024403043424423 |
6 | 1034113310030012041 |
7 | 32406650001205261 |
oct | 3135670266351531 |
9 | 480511583322357 |
10 | 112003131233113 |
11 | 3276229673583a |
12 | 1068ab5a047021 |
13 | 4a65b08477b93 |
14 | 1d92da25d87a1 |
15 | ce36d2557e5d |
hex | 65ddc2d9d359 |
112003131233113 has 8 divisors (see below), whose sum is σ = 115051853130368. Its totient is φ = 108955546717104.
The previous prime is 112003131233099. The next prime is 112003131233167. The reversal of 112003131233113 is 311332131300211.
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 112003131233113 - 237 = 111865692279641 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112003131293113) 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, 284145681 + ... + 284539582.
It is an arithmetic number, because the mean of its divisors is an integer number (14381481641296).
Almost surely, 2112003131233113 is an apocalyptic number.
It is an amenable number.
112003131233113 is a deficient number, since it is larger than the sum of its proper divisors (3048721897255).
112003131233113 is an equidigital number, since it uses as much as digits as its factorization.
112003131233113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568690623.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 112003131233113 its reverse (311332131300211), we get a palindrome (423335262533324).
The spelling of 112003131233113 in words is "one hundred twelve trillion, three billion, one hundred thirty-one million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •