Base | Representation |
---|---|
bin | 11000010000110000000110… |
… | …111111100010000111001101 |
3 | 111222210211102001222212211211 |
4 | 120100300012333202013031 |
5 | 102441220333403214132 |
6 | 1014535134405414421 |
7 | 31322062435640341 |
oct | 3020600677420715 |
9 | 458724361885754 |
10 | 106704284819917 |
11 | 30aaa040007904 |
12 | bb7400910a411 |
13 | 477022b578875 |
14 | 1c4c72cddb621 |
15 | c50953a96147 |
hex | 610c06fe21cd |
106704284819917 has 2 divisors, whose sum is σ = 106704284819918. Its totient is φ = 106704284819916.
The previous prime is 106704284819863. The next prime is 106704284819921. The reversal of 106704284819917 is 719918482407601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56018129444676 + 50686155375241 = 7484526^2 + 7119421^2 .
It is a cyclic number.
It is not a de Polignac number, because 106704284819917 - 235 = 106669925081549 is a prime.
It is a super-2 number, since 2×1067042848199172 (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 (106704284810917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53352142409958 + 53352142409959.
It is an arithmetic number, because the mean of its divisors is an integer number (53352142409959).
Almost surely, 2106704284819917 is an apocalyptic number.
It is an amenable number.
106704284819917 is a deficient number, since it is larger than the sum of its proper divisors (1).
106704284819917 is an equidigital number, since it uses as much as digits as its factorization.
106704284819917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48771072, while the sum is 67.
The spelling of 106704284819917 in words is "one hundred six trillion, seven hundred four billion, two hundred eighty-four million, eight hundred nineteen thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •