Base | Representation |
---|---|
bin | 10000000111101011001… |
… | …000101011111101011111 |
3 | 10220220022002220200110202 |
4 | 100013223020223331133 |
5 | 121122133342034142 |
6 | 2204521035254115 |
7 | 143014054354346 |
oct | 20075310537537 |
9 | 3826262820422 |
10 | 1107751518047 |
11 | 397881942259 |
12 | 15a8338aa33b |
13 | 805ca9ba945 |
14 | 3b888b6cb5d |
15 | 1dc36267032 |
hex | 101eb22bf5f |
1107751518047 has 24 divisors (see below), whose sum is σ = 1162579378176. Its totient is φ = 1054402398000.
The previous prime is 1107751518043. The next prime is 1107751518077. The reversal of 1107751518047 is 7408151577011.
It is not a de Polignac number, because 1107751518047 - 22 = 1107751518043 is a prime.
It is a super-2 number, since 2×11077515180472 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1107751517992 and 1107751518010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107751518043) 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 23 ways as a sum of consecutive naturals, for example, 67344578 + ... + 67361024.
It is an arithmetic number, because the mean of its divisors is an integer number (48440807424).
Almost surely, 21107751518047 is an apocalyptic number.
1107751518047 is a deficient number, since it is larger than the sum of its proper divisors (54827860129).
1107751518047 is an equidigital number, since it uses as much as digits as its factorization.
1107751518047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17051 (or 16980 counting only the distinct ones).
The product of its (nonzero) digits is 274400, while the sum is 47.
The spelling of 1107751518047 in words is "one trillion, one hundred seven billion, seven hundred fifty-one million, five hundred eighteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •