Base | Representation |
---|---|
bin | 110001010111010111… |
… | …0001011100011000011 |
3 | 101010122001120020212112 |
4 | 1202232232023203003 |
5 | 3214102200302421 |
6 | 120411154045535 |
7 | 10442016602111 |
oct | 1425656134303 |
9 | 333561506775 |
10 | 106010556611 |
11 | 40a60217263 |
12 | 186668798ab |
13 | 9cc5b3350b |
14 | 51b941aab1 |
15 | 2b56c5a45b |
hex | 18aeb8b8c3 |
106010556611 has 2 divisors, whose sum is σ = 106010556612. Its totient is φ = 106010556610.
The previous prime is 106010556503. The next prime is 106010556629. The reversal of 106010556611 is 116655010601.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106010556611 is a prime.
It is a super-2 number, since 2×1060105566112 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (106010556011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53005278305 + 53005278306.
It is an arithmetic number, because the mean of its divisors is an integer number (53005278306).
Almost surely, 2106010556611 is an apocalyptic number.
106010556611 is a deficient number, since it is larger than the sum of its proper divisors (1).
106010556611 is an equidigital number, since it uses as much as digits as its factorization.
106010556611 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 106010556611 in words is "one hundred six billion, ten million, five hundred fifty-six thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •