Base | Representation |
---|---|
bin | 10110111111101001111111… |
… | …000010100111010110000001 |
3 | 111021002001220022222222112101 |
4 | 112333221333002213112001 |
5 | 101223414132410442424 |
6 | 555031045503030401 |
7 | 30205335100653601 |
oct | 2677517702472601 |
9 | 437061808888471 |
10 | 101131431343489 |
11 | 2a2506655587a8 |
12 | b413b4789b401 |
13 | 44578649ba401 |
14 | 1ad8b04874c01 |
15 | ba59d9881344 |
hex | 5bfa7f0a7581 |
101131431343489 has 2 divisors, whose sum is σ = 101131431343490. Its totient is φ = 101131431343488.
The previous prime is 101131431343421. The next prime is 101131431343493. The reversal of 101131431343489 is 984343134131101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99674425429264 + 1457005914225 = 9983708^2 + 1207065^2 .
It is a cyclic number.
It is not a de Polignac number, because 101131431343489 - 219 = 101131430819201 is a prime.
It is not a weakly prime, because it can be changed into another prime (101131431343889) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50565715671744 + 50565715671745.
It is an arithmetic number, because the mean of its divisors is an integer number (50565715671745).
Almost surely, 2101131431343489 is an apocalyptic number.
It is an amenable number.
101131431343489 is a deficient number, since it is larger than the sum of its proper divisors (1).
101131431343489 is an equidigital number, since it uses as much as digits as its factorization.
101131431343489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 46.
The spelling of 101131431343489 in words is "one hundred one trillion, one hundred thirty-one billion, four hundred thirty-one million, three hundred forty-three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •