Base | Representation |
---|---|
bin | 10111010110100100111110… |
… | …110011001011111111101101 |
3 | 111110122122201000001112212021 |
4 | 113112210332303023333231 |
5 | 101430221112234230432 |
6 | 1002234432542310141 |
7 | 30430210312232425 |
oct | 2726447663137755 |
9 | 443578630045767 |
10 | 102706606555117 |
11 | 2a7a8699932264 |
12 | b62928a888351 |
13 | 4540264795456 |
14 | 1b51052187485 |
15 | bd197b852697 |
hex | 5d693eccbfed |
102706606555117 has 8 divisors (see below), whose sum is σ = 102972471826496. Its totient is φ = 102440920866912.
The previous prime is 102706606555093. The next prime is 102706606555169. The reversal of 102706606555117 is 711555606607201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102706606555117 - 27 = 102706606554989 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 (102706606550117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43750443 + ... + 46038184.
It is an arithmetic number, because the mean of its divisors is an integer number (12871558978312).
Almost surely, 2102706606555117 is an apocalyptic number.
It is an amenable number.
102706606555117 is a deficient number, since it is larger than the sum of its proper divisors (265865271379).
102706606555117 is an equidigital number, since it uses as much as digits as its factorization.
102706606555117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89791587.
The product of its (nonzero) digits is 2646000, while the sum is 52.
The spelling of 102706606555117 in words is "one hundred two trillion, seven hundred six billion, six hundred six million, five hundred fifty-five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •