Base | Representation |
---|---|
bin | 11000001111110100110011… |
… | …111011000011010010011001 |
3 | 111222120202001202022201012211 |
4 | 120033310303323003102121 |
5 | 102434144434203012421 |
6 | 1014450004413235121 |
7 | 31314346554560452 |
oct | 3017646373032231 |
9 | 458522052281184 |
10 | 106640614110361 |
11 | 30a85037606391 |
12 | bb637b9a92aa1 |
13 | 47672224b1ab6 |
14 | 1c4960cc30129 |
15 | c4de78e659e1 |
hex | 60fd33ec3499 |
106640614110361 has 2 divisors, whose sum is σ = 106640614110362. Its totient is φ = 106640614110360.
The previous prime is 106640614110347. The next prime is 106640614110413. The reversal of 106640614110361 is 163011416046601.
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., 61127456744025 + 45513157366336 = 7818405^2 + 6746344^2 .
It is a cyclic number.
It is not a de Polignac number, because 106640614110361 - 29 = 106640614109849 is a prime.
It is a super-2 number, since 2×1066406141103612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106640614110061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53320307055180 + 53320307055181.
It is an arithmetic number, because the mean of its divisors is an integer number (53320307055181).
Almost surely, 2106640614110361 is an apocalyptic number.
It is an amenable number.
106640614110361 is a deficient number, since it is larger than the sum of its proper divisors (1).
106640614110361 is an equidigital number, since it uses as much as digits as its factorization.
106640614110361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 40.
The spelling of 106640614110361 in words is "one hundred six trillion, six hundred forty billion, six hundred fourteen million, one hundred ten thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •