Base | Representation |
---|---|
bin | 110001001011011101… |
… | …1001100010111001101 |
3 | 101002121020022122211202 |
4 | 1202112323030113031 |
5 | 3212242444032022 |
6 | 120303412555245 |
7 | 10426101235253 |
oct | 1422673142715 |
9 | 332536278752 |
10 | 105611314637 |
11 | 40875919914 |
12 | 18575022b25 |
13 | 9c611c8c6a |
14 | 517c3b25d3 |
15 | 2b31b96592 |
hex | 1896ecc5cd |
105611314637 has 2 divisors, whose sum is σ = 105611314638. Its totient is φ = 105611314636.
The previous prime is 105611314621. The next prime is 105611314639. The reversal of 105611314637 is 736413116501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105586653481 + 24661156 = 324941^2 + 4966^2 .
It is a cyclic number.
It is not a de Polignac number, because 105611314637 - 24 = 105611314621 is a prime.
It is a super-2 number, since 2×1056113146372 (a number of 23 digits) contains 22 as substring.
Together with 105611314639, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 105611314637.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105611314639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52805657318 + 52805657319.
It is an arithmetic number, because the mean of its divisors is an integer number (52805657319).
Almost surely, 2105611314637 is an apocalyptic number.
It is an amenable number.
105611314637 is a deficient number, since it is larger than the sum of its proper divisors (1).
105611314637 is an equidigital number, since it uses as much as digits as its factorization.
105611314637 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 105611314637 in words is "one hundred five billion, six hundred eleven million, three hundred fourteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •