Base | Representation |
---|---|
bin | 11000001111011011001010… |
… | …011000010011001101111101 |
3 | 111222111002222101222021102111 |
4 | 120033123022120103031331 |
5 | 102433222033314322432 |
6 | 1014425211520254021 |
7 | 31312353231161554 |
oct | 3017331230231575 |
9 | 458432871867374 |
10 | 106613073589117 |
11 | 30a7439470a127 |
12 | bb5a3b2771311 |
13 | 476475382c294 |
14 | 1c481592c8d9b |
15 | c4d3b6211347 |
hex | 60f6ca61337d |
106613073589117 has 2 divisors, whose sum is σ = 106613073589118. Its totient is φ = 106613073589116.
The previous prime is 106613073589109. The next prime is 106613073589129. The reversal of 106613073589117 is 711985370316601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60258408991641 + 46354664597476 = 7762629^2 + 6808426^2 .
It is a cyclic number.
It is not a de Polignac number, because 106613073589117 - 23 = 106613073589109 is a prime.
It is a super-2 number, since 2×1066130735891172 (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 (106613073589177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53306536794558 + 53306536794559.
It is an arithmetic number, because the mean of its divisors is an integer number (53306536794559).
Almost surely, 2106613073589117 is an apocalyptic number.
It is an amenable number.
106613073589117 is a deficient number, since it is larger than the sum of its proper divisors (1).
106613073589117 is an equidigital number, since it uses as much as digits as its factorization.
106613073589117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5715360, while the sum is 58.
The spelling of 106613073589117 in words is "one hundred six trillion, six hundred thirteen billion, seventy-three million, five hundred eighty-nine thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •