Base | Representation |
---|---|
bin | 11001011110010001000001… |
… | …010101011111100011111011 |
3 | 112200200001122121211111211110 |
4 | 121132101001111133203323 |
5 | 104141004013403232303 |
6 | 1034134201433331403 |
7 | 32411655122164002 |
oct | 3136210125374373 |
9 | 480601577744743 |
10 | 112031023102203 |
11 | 327730a9997917 |
12 | 10694442b66b63 |
13 | 4a68631b6622a |
14 | 1d9448aa7bc39 |
15 | ce42b6060703 |
hex | 65e44155f8fb |
112031023102203 has 8 divisors (see below), whose sum is σ = 149382005153616. Its totient is φ = 74683694892800.
The previous prime is 112031023102199. The next prime is 112031023102303. The reversal of 112031023102203 is 302201320130211.
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 112031023102203 - 22 = 112031023102199 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112031023102203.
It is not an unprimeable number, because it can be changed into a prime (112031023102303) 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, 913388958 + ... + 913511603.
It is an arithmetic number, because the mean of its divisors is an integer number (18672750644202).
Almost surely, 2112031023102203 is an apocalyptic number.
112031023102203 is a deficient number, since it is larger than the sum of its proper divisors (37350982051413).
112031023102203 is a wasteful number, since it uses less digits than its factorization.
112031023102203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1826921005.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 112031023102203 its reverse (302201320130211), we get a palindrome (414232343232414).
The spelling of 112031023102203 in words is "one hundred twelve trillion, thirty-one billion, twenty-three million, one hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •