Base | Representation |
---|---|
bin | 11001010100101110001010… |
… | …100111010010001110010101 |
3 | 112121100100122210010222022011 |
4 | 121110232022213102032111 |
5 | 104044232222330203040 |
6 | 1032513005215304221 |
7 | 32313405235126504 |
oct | 3124561247221625 |
9 | 477310583128264 |
10 | 111375122506645 |
11 | 3253aa19125518 |
12 | 105a92b321b071 |
13 | 4a1b823b6595a |
14 | 1d7082857283b |
15 | cd21c87ed3ea |
hex | 654b8a9d2395 |
111375122506645 has 16 divisors (see below), whose sum is σ = 134406050229360. Its totient is φ = 88596290764800.
The previous prime is 111375122506643. The next prime is 111375122506679. The reversal of 111375122506645 is 546605221573111.
It can be written as a sum of positive squares in 8 ways, for example, as 27883025471844 + 83492097034801 = 5280438^2 + 9137401^2 .
It is not a de Polignac number, because 111375122506645 - 21 = 111375122506643 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111375122506643) 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 15 ways as a sum of consecutive naturals, for example, 1059790 + ... + 14962399.
It is an arithmetic number, because the mean of its divisors is an integer number (8400378139335).
Almost surely, 2111375122506645 is an apocalyptic number.
It is an amenable number.
111375122506645 is a deficient number, since it is larger than the sum of its proper divisors (23030927722715).
111375122506645 is a wasteful number, since it uses less digits than its factorization.
111375122506645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16030056.
The product of its (nonzero) digits is 1512000, while the sum is 49.
The spelling of 111375122506645 in words is "one hundred eleven trillion, three hundred seventy-five billion, one hundred twenty-two million, five hundred six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •