Base | Representation |
---|---|
bin | 110001110010001101… |
… | …0100101110001000011 |
3 | 101012221211122101001021 |
4 | 1203210122211301003 |
5 | 3222423304001122 |
6 | 121040414050311 |
7 | 10503235553605 |
oct | 1434432456103 |
9 | 335854571037 |
10 | 106911390787 |
11 | 41382769313 |
12 | 188784a9997 |
13 | a10a65c7a6 |
14 | 5262d13175 |
15 | 2baad9e1c7 |
hex | 18e46a5c43 |
106911390787 has 2 divisors, whose sum is σ = 106911390788. Its totient is φ = 106911390786.
The previous prime is 106911390743. The next prime is 106911390799. The reversal of 106911390787 is 787093119601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106911390787 - 211 = 106911388739 is a prime.
It is a super-2 number, since 2×1069113907872 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106912390787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53455695393 + 53455695394.
It is an arithmetic number, because the mean of its divisors is an integer number (53455695394).
Almost surely, 2106911390787 is an apocalyptic number.
106911390787 is a deficient number, since it is larger than the sum of its proper divisors (1).
106911390787 is an equidigital number, since it uses as much as digits as its factorization.
106911390787 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 571536, while the sum is 52.
The spelling of 106911390787 in words is "one hundred six billion, nine hundred eleven million, three hundred ninety thousand, seven hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •