Base | Representation |
---|---|
bin | 1001001101000100101110… |
… | …0101111100000000110101 |
3 | 1022211111000220210012200001 |
4 | 2103101023211330000311 |
5 | 2311302143030420332 |
6 | 33305054423551301 |
7 | 2063106160512433 |
oct | 223211345740065 |
9 | 38744026705601 |
10 | 10120211185717 |
11 | 3251a59421096 |
12 | 11754462bb531 |
13 | 585441015349 |
14 | 26db6c529d53 |
15 | 1283b37120e7 |
hex | 9344b97c035 |
10120211185717 has 2 divisors, whose sum is σ = 10120211185718. Its totient is φ = 10120211185716.
The previous prime is 10120211185699. The next prime is 10120211185723. The reversal of 10120211185717 is 71758111202101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9274180985316 + 846030200401 = 3045354^2 + 919799^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120211185717 - 27 = 10120211185589 is a prime.
It is a super-2 number, since 2×101202111857172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120211189717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060105592858 + 5060105592859.
It is an arithmetic number, because the mean of its divisors is an integer number (5060105592859).
Almost surely, 210120211185717 is an apocalyptic number.
It is an amenable number.
10120211185717 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120211185717 is an equidigital number, since it uses as much as digits as its factorization.
10120211185717 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7840, while the sum is 37.
Adding to 10120211185717 its reverse (71758111202101), we get a palindrome (81878322387818).
The spelling of 10120211185717 in words is "ten trillion, one hundred twenty billion, two hundred eleven million, one hundred eighty-five thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •