Base | Representation |
---|---|
bin | 101111000011001110… |
… | …1100010110110001001 |
3 | 100122210122211220121201 |
4 | 1132012131202312021 |
5 | 3123412233432112 |
6 | 114230040504201 |
7 | 10204604005432 |
oct | 1360635426611 |
9 | 318718756551 |
10 | 101040139657 |
11 | 3993a585456 |
12 | 176ba17b061 |
13 | 96b3161bb2 |
14 | 4c6725a489 |
15 | 29656e9257 |
hex | 1786762d89 |
101040139657 has 2 divisors, whose sum is σ = 101040139658. Its totient is φ = 101040139656.
The previous prime is 101040139639. The next prime is 101040139661. The reversal of 101040139657 is 756931040101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95335207696 + 5704931961 = 308764^2 + 75531^2 .
It is a cyclic number.
It is not a de Polignac number, because 101040139657 - 215 = 101040106889 is a prime.
It is not a weakly prime, because it can be changed into another prime (101040139667) 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, 50520069828 + 50520069829.
It is an arithmetic number, because the mean of its divisors is an integer number (50520069829).
Almost surely, 2101040139657 is an apocalyptic number.
It is an amenable number.
101040139657 is a deficient number, since it is larger than the sum of its proper divisors (1).
101040139657 is an equidigital number, since it uses as much as digits as its factorization.
101040139657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
Adding to 101040139657 its reverse (756931040101), we get a palindrome (857971179758).
The spelling of 101040139657 in words is "one hundred one billion, forty million, one hundred thirty-nine thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •