Base | Representation |
---|---|
bin | 11101011011000001110… |
… | …00101010010101000101 |
3 | 10120122102100012021122122 |
4 | 32231200320222111011 |
5 | 113030402322440431 |
6 | 2052230512135325 |
7 | 133016050565615 |
oct | 16554070522505 |
9 | 3518370167578 |
10 | 1010942780741 |
11 | 35a813932043 |
12 | 143b16837545 |
13 | 744403aab2a |
14 | 36d038a0a45 |
15 | 1b46c2a1a7b |
hex | eb60e2a545 |
1010942780741 has 2 divisors, whose sum is σ = 1010942780742. Its totient is φ = 1010942780740.
The previous prime is 1010942780677. The next prime is 1010942780759. The reversal of 1010942780741 is 1470872490101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 955449555841 + 55493224900 = 977471^2 + 235570^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010942780741 - 26 = 1010942780677 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1010942780692 and 1010942780701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010942780641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505471390370 + 505471390371.
It is an arithmetic number, because the mean of its divisors is an integer number (505471390371).
Almost surely, 21010942780741 is an apocalyptic number.
It is an amenable number.
1010942780741 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010942780741 is an equidigital number, since it uses as much as digits as its factorization.
1010942780741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112896, while the sum is 44.
The spelling of 1010942780741 in words is "one trillion, ten billion, nine hundred forty-two million, seven hundred eighty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •