Base | Representation |
---|---|
bin | 1100101101010… |
… | …10100111011111 |
3 | 21102121002121012 |
4 | 12112222213133 |
5 | 204242330043 |
6 | 14324525435 |
7 | 2433061550 |
oct | 626524737 |
9 | 242532535 |
10 | 106605023 |
11 | 551a2a28 |
12 | 2b85087b |
13 | 19116cc5 |
14 | 10230327 |
15 | 955ba18 |
hex | 65aa9df |
106605023 has 8 divisors (see below), whose sum is σ = 127131648. Its totient is φ = 87402744.
The previous prime is 106605019. The next prime is 106605047. The reversal of 106605023 is 320506601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106605023 - 22 = 106605019 is a prime.
It is a super-2 number, since 2×1066050232 = 22729261857661058, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 106605023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106605013) 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 7 ways as a sum of consecutive naturals, for example, 330911 + ... + 331232.
It is an arithmetic number, because the mean of its divisors is an integer number (15891456).
Almost surely, 2106605023 is an apocalyptic number.
106605023 is a deficient number, since it is larger than the sum of its proper divisors (20526625).
106605023 is an equidigital number, since it uses as much as digits as its factorization.
106605023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662173.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 106605023 is about 10324.9708474165. The cubic root of 106605023 is about 474.1610646836.
The spelling of 106605023 in words is "one hundred six million, six hundred five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •