Base | Representation |
---|---|
bin | 110001011011101110… |
… | …0111110111111101001 |
3 | 101011000021012120100212 |
4 | 1202313130332333221 |
5 | 3214402200344224 |
6 | 120433505510505 |
7 | 10445445661124 |
oct | 1426734767751 |
9 | 334007176325 |
10 | 106157043689 |
11 | 4102597a164 |
12 | 186a7942435 |
13 | a01a2a2468 |
14 | 51d0a6d3bb |
15 | 2b64a43d0e |
hex | 18b773efe9 |
106157043689 has 2 divisors, whose sum is σ = 106157043690. Its totient is φ = 106157043688.
The previous prime is 106157043683. The next prime is 106157043691. The reversal of 106157043689 is 986340751601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106101987289 + 55056400 = 325733^2 + 7420^2 .
It is an emirp because it is prime and its reverse (986340751601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106157043689 - 24 = 106157043673 is a prime.
It is a super-2 number, since 2×1061570436892 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 106157043691, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (106157043683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53078521844 + 53078521845.
It is an arithmetic number, because the mean of its divisors is an integer number (53078521845).
Almost surely, 2106157043689 is an apocalyptic number.
It is an amenable number.
106157043689 is a deficient number, since it is larger than the sum of its proper divisors (1).
106157043689 is an equidigital number, since it uses as much as digits as its factorization.
106157043689 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 106157043689 in words is "one hundred six billion, one hundred fifty-seven million, forty-three thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •