Base | Representation |
---|---|
bin | 10111110111111111010010… |
… | …110101001011001100111111 |
3 | 111202210011001220202110212001 |
4 | 113313333102311023030333 |
5 | 102230330312233441231 |
6 | 1011153310230523131 |
7 | 31055121244032604 |
oct | 2767772265131477 |
9 | 452704056673761 |
10 | 105002602640191 |
11 | 30503398861843 |
12 | b93a25b2064a7 |
13 | 467891a495a99 |
14 | 1bd02200c66ab |
15 | c2155a743b61 |
hex | 5f7fd2d4b33f |
105002602640191 has 2 divisors, whose sum is σ = 105002602640192. Its totient is φ = 105002602640190.
The previous prime is 105002602640099. The next prime is 105002602640233. The reversal of 105002602640191 is 191046206200501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105002602640191 - 213 = 105002602631999 is a prime.
It is a super-2 number, since 2×1050026026401912 (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 105002602640191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105002602646191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52501301320095 + 52501301320096.
It is an arithmetic number, because the mean of its divisors is an integer number (52501301320096).
Almost surely, 2105002602640191 is an apocalyptic number.
105002602640191 is a deficient number, since it is larger than the sum of its proper divisors (1).
105002602640191 is an equidigital number, since it uses as much as digits as its factorization.
105002602640191 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 37.
Adding to 105002602640191 its reverse (191046206200501), we get a palindrome (296048808840692).
The spelling of 105002602640191 in words is "one hundred five trillion, two billion, six hundred two million, six hundred forty thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •