Base | Representation |
---|---|
bin | 10000011011001011100… |
… | …101100011111111010011 |
3 | 10222220100211122010000201 |
4 | 100123023211203333103 |
5 | 121443032421200024 |
6 | 2222303303000031 |
7 | 144355110440335 |
oct | 20331345437723 |
9 | 3886324563021 |
10 | 1128697053139 |
11 | 3a5750074837 |
12 | 1628ba439017 |
13 | 82588242ca6 |
14 | 3c8b4865455 |
15 | 1e560006744 |
hex | 106cb963fd3 |
1128697053139 has 2 divisors, whose sum is σ = 1128697053140. Its totient is φ = 1128697053138.
The previous prime is 1128697053019. The next prime is 1128697053173. The reversal of 1128697053139 is 9313507968211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1128697053139 - 213 = 1128697044947 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1128697053139.
It is not a weakly prime, because it can be changed into another prime (1128697053199) 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, 564348526569 + 564348526570.
It is an arithmetic number, because the mean of its divisors is an integer number (564348526570).
Almost surely, 21128697053139 is an apocalyptic number.
1128697053139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1128697053139 is an equidigital number, since it uses as much as digits as its factorization.
1128697053139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 55.
The spelling of 1128697053139 in words is "one trillion, one hundred twenty-eight billion, six hundred ninety-seven million, fifty-three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •