Base | Representation |
---|---|
bin | 110001101100011110… |
… | …1001101100000001101 |
3 | 101012110102220000100022 |
4 | 1203120331031200031 |
5 | 3222030044433403 |
6 | 121005345311525 |
7 | 10465412502344 |
oct | 1433075154015 |
9 | 335412800308 |
10 | 106719139853 |
11 | 41294199347 |
12 | 188240355a5 |
13 | a0a9889641 |
14 | 524558ab5b |
15 | 2b99075d38 |
hex | 18d8f4d80d |
106719139853 has 2 divisors, whose sum is σ = 106719139854. Its totient is φ = 106719139852.
The previous prime is 106719139829. The next prime is 106719139907. The reversal of 106719139853 is 358931917601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99797232649 + 6921907204 = 315907^2 + 83198^2 .
It is an emirp because it is prime and its reverse (358931917601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106719139853 is a prime.
It is a super-2 number, since 2×1067191398532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106719139795 and 106719139804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106719139253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53359569926 + 53359569927.
It is an arithmetic number, because the mean of its divisors is an integer number (53359569927).
Almost surely, 2106719139853 is an apocalyptic number.
It is an amenable number.
106719139853 is a deficient number, since it is larger than the sum of its proper divisors (1).
106719139853 is an equidigital number, since it uses as much as digits as its factorization.
106719139853 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1224720, while the sum is 53.
The spelling of 106719139853 in words is "one hundred six billion, seven hundred nineteen million, one hundred thirty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •