Base | Representation |
---|---|
bin | 11001011110000000010101… |
… | …110000011100110110011100 |
3 | 112200121100102101010102222200 |
4 | 121132000111300130312130 |
5 | 104140210323144233200 |
6 | 1034122040250411500 |
7 | 32410452224201253 |
oct | 3136002560346634 |
9 | 480540371112880 |
10 | 112013112102300 |
11 | 32766548673562 |
12 | 10690a84730b90 |
13 | 4a66a391c7736 |
14 | 1d9366bdbb79a |
15 | ce3ab88d7800 |
hex | 65e015c1cd9c |
112013112102300 has 54 divisors (see below), whose sum is σ = 351098876936808. Its totient is φ = 29870163227040.
The previous prime is 112013112102289. The next prime is 112013112102341. The reversal of 112013112102300 is 3201211310211.
112013112102300 is a `hidden beast` number, since 1 + 1 + 20 + 131 + 1 + 210 + 2 + 300 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 62229505824 + ... + 62229507623.
Almost surely, 2112013112102300 is an apocalyptic number.
112013112102300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112013112102300 is an abundant number, since it is smaller than the sum of its proper divisors (239085764834508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112013112102300 is a wasteful number, since it uses less digits than its factorization.
112013112102300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124459013467 (or 124459013457 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 112013112102300 its reverse (3201211310211), we get a palindrome (115214323412511).
The spelling of 112013112102300 in words is "one hundred twelve trillion, thirteen billion, one hundred twelve million, one hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •