Base | Representation |
---|---|
bin | 110001110101001100… |
… | …1011111100011110001 |
3 | 101020012211111222122202 |
4 | 1203222121133203301 |
5 | 3223130003012023 |
6 | 121054401312545 |
7 | 10505565002321 |
oct | 1435231374361 |
9 | 336184458582 |
10 | 107011766513 |
11 | 41424397063 |
12 | 188a6035755 |
13 | a1253a5302 |
14 | 52723a1281 |
15 | 2bb4aca128 |
hex | 18ea65f8f1 |
107011766513 has 2 divisors, whose sum is σ = 107011766514. Its totient is φ = 107011766512.
The previous prime is 107011766501. The next prime is 107011766527. The reversal of 107011766513 is 315667110701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106908073024 + 103693489 = 326968^2 + 10183^2 .
It is a cyclic number.
It is not a de Polignac number, because 107011766513 - 214 = 107011750129 is a prime.
It is a super-2 number, since 2×1070117665132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (107011766713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53505883256 + 53505883257.
It is an arithmetic number, because the mean of its divisors is an integer number (53505883257).
Almost surely, 2107011766513 is an apocalyptic number.
It is an amenable number.
107011766513 is a deficient number, since it is larger than the sum of its proper divisors (1).
107011766513 is an equidigital number, since it uses as much as digits as its factorization.
107011766513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 38.
The spelling of 107011766513 in words is "one hundred seven billion, eleven million, seven hundred sixty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •