Base | Representation |
---|---|
bin | 1100101101110… |
… | …01000100101001 |
3 | 21102201002211011 |
4 | 12112321010221 |
5 | 204301223413 |
6 | 14330103521 |
7 | 2433426304 |
oct | 626710451 |
9 | 242632734 |
10 | 106664233 |
11 | 55233465 |
12 | 2b87aba1 |
13 | 19137c40 |
14 | 10247b3b |
15 | 956e33d |
hex | 65b9129 |
106664233 has 16 divisors (see below), whose sum is σ = 125092800. Its totient is φ = 90054720.
The previous prime is 106664221. The next prime is 106664263. The reversal of 106664233 is 332466601.
It is a cyclic number.
It is not a de Polignac number, because 106664233 - 213 = 106656041 is a prime.
It is a super-2 number, since 2×1066642332 = 22754517202956578, 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 = 106664195 and 106664204.
It is not an unprimeable number, because it can be changed into a prime (106664263) 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, 283 + ... + 14608.
It is an arithmetic number, because the mean of its divisors is an integer number (7818300).
Almost surely, 2106664233 is an apocalyptic number.
106664233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
106664233 is a deficient number, since it is larger than the sum of its proper divisors (18428567).
106664233 is a wasteful number, since it uses less digits than its factorization.
106664233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14952.
The product of its (nonzero) digits is 15552, while the sum is 31.
The square root of 106664233 is about 10327.8377698335. The cubic root of 106664233 is about 474.2488337826.
The spelling of 106664233 in words is "one hundred six million, six hundred sixty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •