Base | Representation |
---|---|
bin | 10111000010100100001000… |
… | …110000110111011010111011 |
3 | 111021210011211020210020121012 |
4 | 113002210020300313122323 |
5 | 101240203010433122141 |
6 | 555302543353504135 |
7 | 30225642223163615 |
oct | 2702441060673273 |
9 | 437704736706535 |
10 | 101331310442171 |
11 | 2a318405051a57 |
12 | b44682aa1204b |
13 | 4470669c58334 |
14 | 1b04666883db5 |
15 | baacd73c2ceb |
hex | 5c2908c376bb |
101331310442171 has 2 divisors, whose sum is σ = 101331310442172. Its totient is φ = 101331310442170.
The previous prime is 101331310442143. The next prime is 101331310442209. The reversal of 101331310442171 is 171244013133101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101331310442171 - 234 = 101314130572987 is a prime.
It is a super-3 number, since 3×1013313104421713 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101331310442071) 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, 50665655221085 + 50665655221086.
It is an arithmetic number, because the mean of its divisors is an integer number (50665655221086).
Almost surely, 2101331310442171 is an apocalyptic number.
101331310442171 is a deficient number, since it is larger than the sum of its proper divisors (1).
101331310442171 is an equidigital number, since it uses as much as digits as its factorization.
101331310442171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
Adding to 101331310442171 its reverse (171244013133101), we get a palindrome (272575323575272).
The spelling of 101331310442171 in words is "one hundred one trillion, three hundred thirty-one billion, three hundred ten million, four hundred forty-two thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •