Base | Representation |
---|---|
bin | 101101101011011001100… |
… | …001100010111100110101 |
3 | 102010002020121100000110112 |
4 | 231223121201202330311 |
5 | 402412110221411421 |
6 | 10402005300232405 |
7 | 442532512106066 |
oct | 55533141427465 |
9 | 12102217300415 |
10 | 3138975575861 |
11 | 10002609748a4 |
12 | 42843069b705 |
13 | 19a0090b2968 |
14 | abcda45a56d |
15 | 569ba55c45b |
hex | 2dad9862f35 |
3138975575861 has 2 divisors, whose sum is σ = 3138975575862. Its totient is φ = 3138975575860.
The previous prime is 3138975575851. The next prime is 3138975576013. The reversal of 3138975575861 is 1685755798313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2862897840100 + 276077735761 = 1692010^2 + 525431^2 .
It is a cyclic number.
It is not a de Polignac number, because 3138975575861 - 238 = 2864097668917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3138975575791 and 3138975575800.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3138975575851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1569487787930 + 1569487787931.
It is an arithmetic number, because the mean of its divisors is an integer number (1569487787931).
Almost surely, 23138975575861 is an apocalyptic number.
It is an amenable number.
3138975575861 is a deficient number, since it is larger than the sum of its proper divisors (1).
3138975575861 is an equidigital number, since it uses as much as digits as its factorization.
3138975575861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 190512000, while the sum is 68.
The spelling of 3138975575861 in words is "three trillion, one hundred thirty-eight billion, nine hundred seventy-five million, five hundred seventy-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •