Base | Representation |
---|---|
bin | 10111000101000010101010… |
… | …110000101100110000111001 |
3 | 111022101110012021201221220022 |
4 | 113011002222300230300321 |
5 | 101301000114200011212 |
6 | 555513054325140225 |
7 | 30244146404626463 |
oct | 2705025260546071 |
9 | 438343167657808 |
10 | 101501532032057 |
11 | 2a383615768963 |
12 | b47381585a675 |
13 | 4483726a886a1 |
14 | 1b0c9b3b1d133 |
15 | bb044b3de772 |
hex | 5c50aac2cc39 |
101501532032057 has 2 divisors, whose sum is σ = 101501532032058. Its totient is φ = 101501532032056.
The previous prime is 101501532032023. The next prime is 101501532032063. The reversal of 101501532032057 is 750230235105101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91552958125561 + 9948573906496 = 9568331^2 + 3154136^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101501532032057 is a prime.
It is a super-2 number, since 2×1015015320320572 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101501532032357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50750766016028 + 50750766016029.
It is an arithmetic number, because the mean of its divisors is an integer number (50750766016029).
Almost surely, 2101501532032057 is an apocalyptic number.
It is an amenable number.
101501532032057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101501532032057 is an equidigital number, since it uses as much as digits as its factorization.
101501532032057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 35.
Adding to 101501532032057 its reverse (750230235105101), we get a palindrome (851731767137158).
The spelling of 101501532032057 in words is "one hundred one trillion, five hundred one billion, five hundred thirty-two million, thirty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •