Base | Representation |
---|---|
bin | 10000001011000001000… |
… | …101111001010011111011 |
3 | 10221020120021100212122020 |
4 | 100023001011321103323 |
5 | 121202011311014043 |
6 | 2210313144525523 |
7 | 143202032401500 |
oct | 20130105712373 |
9 | 3836507325566 |
10 | 1111341110523 |
11 | 3993540a2206 |
12 | 15b475a808a3 |
13 | 80a50595867 |
14 | 3bb097ad4a7 |
15 | 1dd9646ee83 |
hex | 102c11794fb |
1111341110523 has 12 divisors (see below), whose sum is σ = 1723712743080. Its totient is φ = 635052063072.
The previous prime is 1111341110513. The next prime is 1111341110527. The reversal of 1111341110523 is 3250111431111.
It is a happy number.
It is not a de Polignac number, because 1111341110523 - 28 = 1111341110267 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111341110493 and 1111341110502.
It is not an unprimeable number, because it can be changed into a prime (1111341110527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3780071658 + ... + 3780071951.
It is an arithmetic number, because the mean of its divisors is an integer number (143642728590).
Almost surely, 21111341110523 is an apocalyptic number.
1111341110523 is a deficient number, since it is larger than the sum of its proper divisors (612371632557).
1111341110523 is an equidigital number, since it uses as much as digits as its factorization.
1111341110523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7560143626 (or 7560143619 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 24.
Adding to 1111341110523 its reverse (3250111431111), we get a palindrome (4361452541634).
The spelling of 1111341110523 in words is "one trillion, one hundred eleven billion, three hundred forty-one million, one hundred ten thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •