Base | Representation |
---|---|
bin | 1100101101011… |
… | …01011011100111 |
3 | 21102121200102011 |
4 | 12112231123213 |
5 | 204243212201 |
6 | 14325055051 |
7 | 2433140266 |
oct | 626553347 |
9 | 242550364 |
10 | 106616551 |
11 | 55200658 |
12 | 2b857487 |
13 | 1911c322 |
14 | 102345dd |
15 | 9560151 |
hex | 65ad6e7 |
106616551 has 4 divisors (see below), whose sum is σ = 107394912. Its totient is φ = 105838192.
The previous prime is 106616491. The next prime is 106616561. The reversal of 106616551 is 155616601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106616551 - 27 = 106616423 is a prime.
It is a super-2 number, since 2×1066165512 = 22734177894271202, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106616561) 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 in 3 ways as a sum of consecutive naturals, for example, 388975 + ... + 389248.
It is an arithmetic number, because the mean of its divisors is an integer number (26848728).
Almost surely, 2106616551 is an apocalyptic number.
106616551 is a deficient number, since it is larger than the sum of its proper divisors (778361).
106616551 is an equidigital number, since it uses as much as digits as its factorization.
106616551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778360.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 106616551 is about 10325.5290905600. The cubic root of 106616551 is about 474.1781555972.
Subtracting 106616551 from its reverse (155616601), we obtain a triangular number (49000050 = T9899).
The spelling of 106616551 in words is "one hundred six million, six hundred sixteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •