Base | Representation |
---|---|
bin | 110001110100010111… |
… | …0100111110000100001 |
3 | 101020010212210122011122 |
4 | 1203220232213300201 |
5 | 3223100320010224 |
6 | 121051521022025 |
7 | 10505104606454 |
oct | 1435056476041 |
9 | 336125718148 |
10 | 106983750689 |
11 | 4140a5a1392 |
12 | 18898784915 |
13 | a11c6464ba |
14 | 526c78b49b |
15 | 2bb23e415e |
hex | 18e8ba7c21 |
106983750689 has 2 divisors, whose sum is σ = 106983750690. Its totient is φ = 106983750688.
The previous prime is 106983750539. The next prime is 106983750691. The reversal of 106983750689 is 986057389601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79646435089 + 27337315600 = 282217^2 + 165340^2 .
It is an emirp because it is prime and its reverse (986057389601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106983750689 is a prime.
It is a super-2 number, since 2×1069837506892 (a number of 23 digits) contains 22 as substring.
Together with 106983750691, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (106983750989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53491875344 + 53491875345.
It is an arithmetic number, because the mean of its divisors is an integer number (53491875345).
Almost surely, 2106983750689 is an apocalyptic number.
It is an amenable number.
106983750689 is a deficient number, since it is larger than the sum of its proper divisors (1).
106983750689 is an equidigital number, since it uses as much as digits as its factorization.
106983750689 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19595520, while the sum is 62.
The spelling of 106983750689 in words is "one hundred six billion, nine hundred eighty-three million, seven hundred fifty thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •