Base | Representation |
---|---|
bin | 10111111001001111101001… |
… | …110100100000100000010011 |
3 | 111210002101210021022000111101 |
4 | 113321033221310200200103 |
5 | 102233234020221442222 |
6 | 1011301100222525231 |
7 | 31064264413603435 |
oct | 2771175164404023 |
9 | 453071707260441 |
10 | 105088887687187 |
11 | 30536a4648a738 |
12 | b952b1ba36817 |
13 | 4683abb75a301 |
14 | 1bd4487870655 |
15 | c2390a8a3927 |
hex | 5f93e9d20813 |
105088887687187 has 2 divisors, whose sum is σ = 105088887687188. Its totient is φ = 105088887687186.
The previous prime is 105088887687139. The next prime is 105088887687227. The reversal of 105088887687187 is 781786788880501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105088887687187 - 211 = 105088887685139 is a prime.
It is a super-2 number, since 2×1050888876871872 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105088887687187.
It is not a weakly prime, because it can be changed into another prime (105088887687787) 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, 52544443843593 + 52544443843594.
It is an arithmetic number, because the mean of its divisors is an integer number (52544443843594).
Almost surely, 2105088887687187 is an apocalyptic number.
105088887687187 is a deficient number, since it is larger than the sum of its proper divisors (1).
105088887687187 is an equidigital number, since it uses as much as digits as its factorization.
105088887687187 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2697461760, while the sum is 82.
The spelling of 105088887687187 in words is "one hundred five trillion, eighty-eight billion, eight hundred eighty-seven million, six hundred eighty-seven thousand, one hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •