Base | Representation |
---|---|
bin | 11001010011110100010101… |
… | …000001100001011011001111 |
3 | 112121010102100202120102101011 |
4 | 121103310111001201123033 |
5 | 104042223031123143043 |
6 | 1032424255010030051 |
7 | 32306046256502014 |
oct | 3123642501413317 |
9 | 477112322512334 |
10 | 111313020131023 |
11 | 3251664aa37547 |
12 | 10599261278327 |
13 | 4a15a07998529 |
14 | 1d6b8167b570b |
15 | cd079171459d |
hex | 653d150616cf |
111313020131023 has 2 divisors, whose sum is σ = 111313020131024. Its totient is φ = 111313020131022.
The previous prime is 111313020130933. The next prime is 111313020131029. The reversal of 111313020131023 is 320131020313111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111313020131023 - 233 = 111304430196431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111313020130985 and 111313020131003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111313020131029) 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 as a sum of consecutive naturals, namely, 55656510065511 + 55656510065512.
It is an arithmetic number, because the mean of its divisors is an integer number (55656510065512).
Almost surely, 2111313020131023 is an apocalyptic number.
111313020131023 is a deficient number, since it is larger than the sum of its proper divisors (1).
111313020131023 is an equidigital number, since it uses as much as digits as its factorization.
111313020131023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 111313020131023 its reverse (320131020313111), we get a palindrome (431444040444134).
The spelling of 111313020131023 in words is "one hundred eleven trillion, three hundred thirteen billion, twenty million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •