Base | Representation |
---|---|
bin | 10110111100110100110… |
… | …100010100101010110011 |
3 | 12120202212112111220111202 |
4 | 112330310310110222303 |
5 | 201314440104112021 |
6 | 3204305553001415 |
7 | 221641656256265 |
oct | 26746464245263 |
9 | 5522775456452 |
10 | 1577139129011 |
11 | 558951a16786 |
12 | 2157b085326b |
13 | b595392a944 |
14 | 56496497b35 |
15 | 2b059607a0b |
hex | 16f34d14ab3 |
1577139129011 has 2 divisors, whose sum is σ = 1577139129012. Its totient is φ = 1577139129010.
The previous prime is 1577139128947. The next prime is 1577139129023. The reversal of 1577139129011 is 1109219317751.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1577139129011 - 26 = 1577139128947 is a prime.
It is not a weakly prime, because it can be changed into another prime (1577139119011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 788569564505 + 788569564506.
It is an arithmetic number, because the mean of its divisors is an integer number (788569564506).
Almost surely, 21577139129011 is an apocalyptic number.
1577139129011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1577139129011 is an equidigital number, since it uses as much as digits as its factorization.
1577139129011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 119070, while the sum is 47.
Subtracting from 1577139129011 its sum of digits (47), we obtain a square (1577139128964 = 12558422).
The spelling of 1577139129011 in words is "one trillion, five hundred seventy-seven billion, one hundred thirty-nine million, one hundred twenty-nine thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •