Base | Representation |
---|---|
bin | 11001101000000010110110… |
… | …010110001101010011011011 |
3 | 112210001022010221000211021011 |
4 | 121220002312112031103123 |
5 | 104233011221241401021 |
6 | 1035411013254354351 |
7 | 32511344301126166 |
oct | 3150026626152333 |
9 | 483038127024234 |
10 | 112703001122011 |
11 | 32a0208aa76aa3 |
12 | 1078271b05b9b7 |
13 | 4ab6b0298a8b1 |
14 | 1db8bd6510add |
15 | d069e4eadde1 |
hex | 6680b658d4db |
112703001122011 has 8 divisors (see below), whose sum is σ = 112834699614000. Its totient is φ = 112571348841600.
The previous prime is 112703001121979. The next prime is 112703001122017. The reversal of 112703001122011 is 110221100307211.
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 112703001122011 - 25 = 112703001121979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112703001122017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6671146 + ... + 16428943.
It is an arithmetic number, because the mean of its divisors is an integer number (14104337451750).
Almost surely, 2112703001122011 is an apocalyptic number.
112703001122011 is a deficient number, since it is larger than the sum of its proper divisors (131698491989).
112703001122011 is a wasteful number, since it uses less digits than its factorization.
112703001122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23105789.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 112703001122011 its reverse (110221100307211), we get a palindrome (222924101429222).
The spelling of 112703001122011 in words is "one hundred twelve trillion, seven hundred three billion, one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •