Base | Representation |
---|---|
bin | 10111111001101000111101… |
… | …001001101101111111100111 |
3 | 111210011222220122102221222011 |
4 | 113321220331021231333213 |
5 | 102234210140210411132 |
6 | 1011321352124415051 |
7 | 31066245563656261 |
oct | 2771507511557747 |
9 | 453158818387864 |
10 | 105116055560167 |
11 | 30547517aa2823 |
12 | b9582423a7487 |
13 | 468652b156cb2 |
14 | 1bd5903ad0b31 |
15 | c2449aa48b47 |
hex | 5f9a3d26dfe7 |
105116055560167 has 2 divisors, whose sum is σ = 105116055560168. Its totient is φ = 105116055560166.
The previous prime is 105116055560143. The next prime is 105116055560179. The reversal of 105116055560167 is 761065550611501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105116055560167 - 27 = 105116055560039 is a prime.
It is a super-2 number, since 2×1051160555601672 (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 105116055560167.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105116055560137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52558027780083 + 52558027780084.
It is an arithmetic number, because the mean of its divisors is an integer number (52558027780084).
Almost surely, 2105116055560167 is an apocalyptic number.
105116055560167 is a deficient number, since it is larger than the sum of its proper divisors (1).
105116055560167 is an equidigital number, since it uses as much as digits as its factorization.
105116055560167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945000, while the sum is 49.
The spelling of 105116055560167 in words is "one hundred five trillion, one hundred sixteen billion, fifty-five million, five hundred sixty thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •