Base | Representation |
---|---|
bin | 10111011011011101111011… |
… | …001001100111011011011101 |
3 | 111111211210000210220012210122 |
4 | 113123131323021213123131 |
5 | 102001222244342013301 |
6 | 1003053043520244325 |
7 | 30463404225621254 |
oct | 2733357311473335 |
9 | 444753023805718 |
10 | 103042626516701 |
11 | 2a918150397853 |
12 | b6824271706a5 |
13 | 4565b54c239a1 |
14 | 1b6340b05b79b |
15 | bda5963b781b |
hex | 5db77b2676dd |
103042626516701 has 8 divisors (see below), whose sum is σ = 104580823350624. Its totient is φ = 101504436953040.
The previous prime is 103042626516631. The next prime is 103042626516719. The reversal of 103042626516701 is 107615626240301.
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 103042626516701 - 246 = 32673882339037 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 (103042626516101) 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, 31177886 + ... + 34324128.
It is an arithmetic number, because the mean of its divisors is an integer number (13072602918828).
Almost surely, 2103042626516701 is an apocalyptic number.
It is an amenable number.
103042626516701 is a deficient number, since it is larger than the sum of its proper divisors (1538196833923).
103042626516701 is an equidigital number, since it uses as much as digits as its factorization.
103042626516701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3635131.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 103042626516701 in words is "one hundred three trillion, forty-two billion, six hundred twenty-six million, five hundred sixteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.539 sec. • engine limits •