Base | Representation |
---|---|
bin | 10000000111010010000… |
… | …110100010101111101101 |
3 | 10220212012211121212011102 |
4 | 100013102012202233231 |
5 | 121120303332304423 |
6 | 2204411233332445 |
7 | 143000464444535 |
oct | 20072206425755 |
9 | 3825184555142 |
10 | 1107331525613 |
11 | 397686861775 |
12 | 15a737107125 |
13 | 80561999501 |
14 | 3b8490824c5 |
15 | 1dc0e454c28 |
hex | 101d21a2bed |
1107331525613 has 4 divisors (see below), whose sum is σ = 1107440492928. Its totient is φ = 1107222558300.
The previous prime is 1107331525607. The next prime is 1107331525681. The reversal of 1107331525613 is 3165251337011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1107331525613 - 230 = 1106257783789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107331525693) 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 3 ways as a sum of consecutive naturals, for example, 54468413 + ... + 54488738.
It is an arithmetic number, because the mean of its divisors is an integer number (276860123232).
Almost surely, 21107331525613 is an apocalyptic number.
It is an amenable number.
1107331525613 is a deficient number, since it is larger than the sum of its proper divisors (108967315).
1107331525613 is a wasteful number, since it uses less digits than its factorization.
1107331525613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108967314.
The product of its (nonzero) digits is 56700, while the sum is 38.
The spelling of 1107331525613 in words is "one trillion, one hundred seven billion, three hundred thirty-one million, five hundred twenty-five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •