Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …111000000101111111000101 |
3 | 112200120002121100021120120000 |
4 | 121131310020320011333011 |
5 | 104140002010320200401 |
6 | 1034112032250431513 |
7 | 32406506453415465 |
oct | 3135641070057705 |
9 | 480502540246500 |
10 | 112000011100101 |
11 | 32760a35482713 |
12 | 1068a429132599 |
13 | 4a6572bc21027 |
14 | 1d92b8807dba5 |
15 | ce359d684186 |
hex | 65dd08e05fc5 |
112000011100101 has 10 divisors (see below), whose sum is σ = 167308658557062. Its totient is φ = 74666674066680.
The previous prime is 112000011100093. The next prime is 112000011100141. The reversal of 112000011100101 is 101001110000211.
It can be written as a sum of positive squares in only one way, i.e., 86054750964900 + 25945260135201 = 9276570^2 + 5093649^2 .
It is not a de Polignac number, because 112000011100101 - 23 = 112000011100093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000011100141) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 691358093130 + ... + 691358093291.
Almost surely, 2112000011100101 is an apocalyptic number.
It is an amenable number.
112000011100101 is a deficient number, since it is larger than the sum of its proper divisors (55308647456961).
112000011100101 is an equidigital number, since it uses as much as digits as its factorization.
112000011100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1382716186433 (or 1382716186424 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 112000011100101 its reverse (101001110000211), we get a palindrome (213001121100312).
The spelling of 112000011100101 in words is "one hundred twelve trillion, eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •