Base | Representation |
---|---|
bin | 11000010001111000001110… |
… | …110111111111101111011101 |
3 | 112000002020022010010110212222 |
4 | 120101320032313333233131 |
5 | 102444002433434120211 |
6 | 1015034503053035125 |
7 | 31330503504063164 |
oct | 3021701667775735 |
9 | 460066263113788 |
10 | 106781726473181 |
11 | 3102996a889141 |
12 | bb87020185aa5 |
13 | 4777620662936 |
14 | 1c523980983db |
15 | c529876611db |
hex | 611e0edffbdd |
106781726473181 has 2 divisors, whose sum is σ = 106781726473182. Its totient is φ = 106781726473180.
The previous prime is 106781726473153. The next prime is 106781726473207. The reversal of 106781726473181 is 181374627187601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101242133467225 + 5539593005956 = 10061915^2 + 2353634^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106781726473181 is a prime.
It is a super-2 number, since 2×1067817264731812 (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 (106781726473151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53390863236590 + 53390863236591.
It is an arithmetic number, because the mean of its divisors is an integer number (53390863236591).
Almost surely, 2106781726473181 is an apocalyptic number.
It is an amenable number.
106781726473181 is a deficient number, since it is larger than the sum of its proper divisors (1).
106781726473181 is an equidigital number, since it uses as much as digits as its factorization.
106781726473181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18966528, while the sum is 62.
The spelling of 106781726473181 in words is "one hundred six trillion, seven hundred eighty-one billion, seven hundred twenty-six million, four hundred seventy-three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •