Base | Representation |
---|---|
bin | 11000000010010001011000… |
… | …001010101000001000101001 |
3 | 111212021200221220012110121211 |
4 | 120002101120022220020221 |
5 | 102323414432323114433 |
6 | 1012454050450233121 |
7 | 31160144605552015 |
oct | 3002213012501051 |
9 | 455250856173554 |
10 | 105709214269993 |
11 | 307560316927a4 |
12 | ba331a1b857a1 |
13 | 46ca44a6399b9 |
14 | 1c164d352d545 |
15 | c34b14e9c8cd |
hex | 6024582a8229 |
105709214269993 has 2 divisors, whose sum is σ = 105709214269994. Its totient is φ = 105709214269992.
The previous prime is 105709214269973. The next prime is 105709214269999. The reversal of 105709214269993 is 399962412907501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102236608108944 + 3472606161049 = 10111212^2 + 1863493^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105709214269993 is a prime.
It is a super-2 number, since 2×1057092142699932 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105709214269999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52854607134996 + 52854607134997.
It is an arithmetic number, because the mean of its divisors is an integer number (52854607134997).
Almost surely, 2105709214269993 is an apocalyptic number.
It is an amenable number.
105709214269993 is a deficient number, since it is larger than the sum of its proper divisors (1).
105709214269993 is an equidigital number, since it uses as much as digits as its factorization.
105709214269993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 66134880, while the sum is 67.
The spelling of 105709214269993 in words is "one hundred five trillion, seven hundred nine billion, two hundred fourteen million, two hundred sixty-nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •