Base | Representation |
---|---|
bin | 1100101101010… |
… | …11111101111101 |
3 | 21102121101012011 |
4 | 12112223331331 |
5 | 204243014212 |
6 | 14325011221 |
7 | 2433113644 |
oct | 626537575 |
9 | 242541164 |
10 | 106610557 |
11 | 551a70a9 |
12 | 2b853b11 |
13 | 19119691 |
14 | 1023235b |
15 | 955d4a7 |
hex | 65abf7d |
106610557 has 4 divisors (see below), whose sum is σ = 106990236. Its totient is φ = 106230880.
The previous prime is 106610549. The next prime is 106610561. The reversal of 106610557 is 755016601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 91757241 + 14853316 = 9579^2 + 3854^2 .
It is a cyclic number.
It is not a de Polignac number, because 106610557 - 23 = 106610549 is a prime.
It is a super-2 number, since 2×1066105572 = 22731621727700498, 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 (106610527) 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 in 3 ways as a sum of consecutive naturals, for example, 189418 + ... + 189979.
It is an arithmetic number, because the mean of its divisors is an integer number (26747559).
Almost surely, 2106610557 is an apocalyptic number.
It is an amenable number.
106610557 is a deficient number, since it is larger than the sum of its proper divisors (379679).
106610557 is an equidigital number, since it uses as much as digits as its factorization.
106610557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379678.
The product of its (nonzero) digits is 6300, while the sum is 31.
The square root of 106610557 is about 10325.2388350101. The cubic root of 106610557 is about 474.1692693061.
The spelling of 106610557 in words is "one hundred six million, six hundred ten thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •