Base | Representation |
---|---|
bin | 11000000010001010100111… |
… | …011101001011100001010101 |
3 | 111212021000012221211222012021 |
4 | 120002022213131023201111 |
5 | 102323310100334131442 |
6 | 1012450450234253141 |
7 | 31156466654431321 |
oct | 3002124735134125 |
9 | 455230187758167 |
10 | 105701954598997 |
11 | 30752a467aa4a9 |
12 | ba318b68871b1 |
13 | 46c98615b64a3 |
14 | 1c160052da981 |
15 | c3483c98de67 |
hex | 6022a774b855 |
105701954598997 has 2 divisors, whose sum is σ = 105701954598998. Its totient is φ = 105701954598996.
The previous prime is 105701954598991. The next prime is 105701954599001. The reversal of 105701954598997 is 799895459107501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98476427813841 + 7225526785156 = 9923529^2 + 2688034^2 .
It is a cyclic number.
It is not a de Polignac number, because 105701954598997 - 27 = 105701954598869 is a prime.
It is a super-2 number, since 2×1057019545989972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105701954598991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52850977299498 + 52850977299499.
It is an arithmetic number, because the mean of its divisors is an integer number (52850977299499).
Almost surely, 2105701954598997 is an apocalyptic number.
It is an amenable number.
105701954598997 is a deficient number, since it is larger than the sum of its proper divisors (1).
105701954598997 is an equidigital number, since it uses as much as digits as its factorization.
105701954598997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1285956000, while the sum is 79.
The spelling of 105701954598997 in words is "one hundred five trillion, seven hundred one billion, nine hundred fifty-four million, five hundred ninety-eight thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •