Base | Representation |
---|---|
bin | 110001101100010101… |
… | …1101110110100101011 |
3 | 101012110010021012212101 |
4 | 1203120223232310223 |
5 | 3222022411321424 |
6 | 121005103154231 |
7 | 10465325526406 |
oct | 1433053566453 |
9 | 335403235771 |
10 | 106714557739 |
11 | 41291649779 |
12 | 188225a5977 |
13 | a0a8943b2a |
14 | 5244b16d3d |
15 | 2b9896d344 |
hex | 18d8aeed2b |
106714557739 has 2 divisors, whose sum is σ = 106714557740. Its totient is φ = 106714557738.
The previous prime is 106714557667. The next prime is 106714557751. The reversal of 106714557739 is 937755417601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106714557739 - 219 = 106714033451 is a prime.
It is a super-2 number, since 2×1067145577392 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106714557739.
It is not a weakly prime, because it can be changed into another prime (106714557779) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53357278869 + 53357278870.
It is an arithmetic number, because the mean of its divisors is an integer number (53357278870).
Almost surely, 2106714557739 is an apocalyptic number.
106714557739 is a deficient number, since it is larger than the sum of its proper divisors (1).
106714557739 is an equidigital number, since it uses as much as digits as its factorization.
106714557739 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5556600, while the sum is 55.
The spelling of 106714557739 in words is "one hundred six billion, seven hundred fourteen million, five hundred fifty-seven thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •