Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …001110000000011110001 |
3 | 10220020220222021001002101 |
4 | 100001121321300003301 |
5 | 121014342101022212 |
6 | 2201445050220401 |
7 | 142355205031543 |
oct | 20013171600361 |
9 | 3806828231071 |
10 | 1101019939057 |
11 | 394a38063335 |
12 | 159475424701 |
13 | 7ca971a6bcc |
14 | 3b40ab25693 |
15 | 1d9902c0157 |
hex | 10059e700f1 |
1101019939057 has 2 divisors, whose sum is σ = 1101019939058. Its totient is φ = 1101019939056.
The previous prime is 1101019939051. The next prime is 1101019939091. The reversal of 1101019939057 is 7509399101011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1095725339361 + 5294599696 = 1046769^2 + 72764^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101019939057 - 27 = 1101019938929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101019938998 and 1101019939016.
It is not a weakly prime, because it can be changed into another prime (1101019939051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550509969528 + 550509969529.
It is an arithmetic number, because the mean of its divisors is an integer number (550509969529).
Almost surely, 21101019939057 is an apocalyptic number.
It is an amenable number.
1101019939057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101019939057 is an equidigital number, since it uses as much as digits as its factorization.
1101019939057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 76545, while the sum is 46.
The spelling of 1101019939057 in words is "one trillion, one hundred one billion, nineteen million, nine hundred thirty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •