Base | Representation |
---|---|
bin | 1100101101000… |
… | …00110110100011 |
3 | 21102112001201212 |
4 | 12112200312203 |
5 | 204240040102 |
6 | 14324020335 |
7 | 2432534132 |
oct | 626406643 |
9 | 242461655 |
10 | 106565027 |
11 | 55175978 |
12 | 2b8316ab |
13 | 19101a3a |
14 | 1021d919 |
15 | 954ec52 |
hex | 65a0da3 |
106565027 has 16 divisors (see below), whose sum is σ = 118081152. Its totient is φ = 95738880.
The previous prime is 106565023. The next prime is 106565057. The reversal of 106565027 is 720565601.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 106565027 - 22 = 106565023 is a prime.
It is a super-2 number, since 2×1065650272 = 22712209959021458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106564984 and 106565002.
It is not an unprimeable number, because it can be changed into a prime (106565021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31133 + ... + 34385.
It is an arithmetic number, because the mean of its divisors is an integer number (7380072).
Almost surely, 2106565027 is an apocalyptic number.
106565027 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
106565027 is a deficient number, since it is larger than the sum of its proper divisors (11516125).
106565027 is a wasteful number, since it uses less digits than its factorization.
106565027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3358.
The product of its (nonzero) digits is 12600, while the sum is 32.
The square root of 106565027 is about 10323.0338079462. The cubic root of 106565027 is about 474.1017587910.
The spelling of 106565027 in words is "one hundred six million, five hundred sixty-five thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •