Base | Representation |
---|---|
bin | 110001100010011010… |
… | …1111010000111110101 |
3 | 101011120220220100000111 |
4 | 1203010311322013311 |
5 | 3220332202244031 |
6 | 120512052343021 |
7 | 10454144240611 |
oct | 1430465720765 |
9 | 334526810014 |
10 | 106381681141 |
11 | 4113075a64a |
12 | 1874b014a71 |
13 | a0549a4928 |
14 | 5212826341 |
15 | 2b796181b1 |
hex | 18c4d7a1f5 |
106381681141 has 2 divisors, whose sum is σ = 106381681142. Its totient is φ = 106381681140.
The previous prime is 106381681139. The next prime is 106381681163. The reversal of 106381681141 is 141186183601.
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., 66798987025 + 39582694116 = 258455^2 + 198954^2 .
It is a cyclic number.
It is not a de Polignac number, because 106381681141 - 21 = 106381681139 is a prime.
It is a super-2 number, since 2×1063816811412 (a number of 23 digits) contains 22 as substring.
Together with 106381681139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 106381681094 and 106381681103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106381681111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53190840570 + 53190840571.
It is an arithmetic number, because the mean of its divisors is an integer number (53190840571).
Almost surely, 2106381681141 is an apocalyptic number.
It is an amenable number.
106381681141 is a deficient number, since it is larger than the sum of its proper divisors (1).
106381681141 is an equidigital number, since it uses as much as digits as its factorization.
106381681141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 40.
The spelling of 106381681141 in words is "one hundred six billion, three hundred eighty-one million, six hundred eighty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •