Base | Representation |
---|---|
bin | 110001110111011001… |
… | …1010100111001110101 |
3 | 101020101222112112021202 |
4 | 1203232303110321311 |
5 | 3223302411204402 |
6 | 121110001022245 |
7 | 10510452661604 |
oct | 1435663247165 |
9 | 336358475252 |
10 | 107085647477 |
11 | 41462068a06 |
12 | 18906924985 |
13 | a1377a2463 |
14 | 527c113a3b |
15 | 2bbb320b02 |
hex | 18eecd4e75 |
107085647477 has 2 divisors, whose sum is σ = 107085647478. Its totient is φ = 107085647476.
The previous prime is 107085647441. The next prime is 107085647479. The reversal of 107085647477 is 774746580701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80043160561 + 27042486916 = 282919^2 + 164446^2 .
It is an emirp because it is prime and its reverse (774746580701) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107085647477 is a prime.
It is a super-2 number, since 2×1070856474772 (a number of 23 digits) contains 22 as substring.
Together with 107085647479, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107085647479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53542823738 + 53542823739.
It is an arithmetic number, because the mean of its divisors is an integer number (53542823739).
Almost surely, 2107085647477 is an apocalyptic number.
It is an amenable number.
107085647477 is a deficient number, since it is larger than the sum of its proper divisors (1).
107085647477 is an equidigital number, since it uses as much as digits as its factorization.
107085647477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9219840, while the sum is 56.
The spelling of 107085647477 in words is "one hundred seven billion, eighty-five million, six hundred forty-seven thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •