Base | Representation |
---|---|
bin | 110001101001010000… |
… | …1001110100101010011 |
3 | 101012011220200002200211 |
4 | 1203102201032211103 |
5 | 3221314423002242 |
6 | 120550530424551 |
7 | 10462631513623 |
oct | 1432241164523 |
9 | 335156602624 |
10 | 106611140947 |
11 | 41239234153 |
12 | 187b3a32157 |
13 | a0903a506c |
14 | 52350b6883 |
15 | 2b8e841317 |
hex | 18d284e953 |
106611140947 has 2 divisors, whose sum is σ = 106611140948. Its totient is φ = 106611140946.
The previous prime is 106611140903. The next prime is 106611141001. The reversal of 106611140947 is 749041116601.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106611140947 is a prime.
It is a super-2 number, since 2×1066111409472 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106611140047) 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, 53305570473 + 53305570474.
It is an arithmetic number, because the mean of its divisors is an integer number (53305570474).
Almost surely, 2106611140947 is an apocalyptic number.
106611140947 is a deficient number, since it is larger than the sum of its proper divisors (1).
106611140947 is an equidigital number, since it uses as much as digits as its factorization.
106611140947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 40.
The spelling of 106611140947 in words is "one hundred six billion, six hundred eleven million, one hundred forty thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •