Base | Representation |
---|---|
bin | 1100101101100… |
… | …01100010101001 |
3 | 21102122112111122 |
4 | 12112301202221 |
5 | 204244232020 |
6 | 14325305025 |
7 | 2433240335 |
oct | 626614251 |
9 | 242575448 |
10 | 106633385 |
11 | 55212271 |
12 | 2b865175 |
13 | 19126ba1 |
14 | 1023a7c5 |
15 | 9565125 |
hex | 65b18a9 |
106633385 has 8 divisors (see below), whose sum is σ = 128131080. Its totient is φ = 85192704.
The previous prime is 106633369. The next prime is 106633393. The reversal of 106633385 is 583336601.
It can be written as a sum of positive squares in 4 ways, for example, as 1283689 + 105349696 = 1133^2 + 10264^2 .
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 106633385 - 24 = 106633369 is a prime.
It is a super-2 number, since 2×1066333852 = 22741357593116450, which contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 10022 + ... + 17711.
It is an arithmetic number, because the mean of its divisors is an integer number (16016385).
Almost surely, 2106633385 is an apocalyptic number.
It is an amenable number.
106633385 is a deficient number, since it is larger than the sum of its proper divisors (21497695).
106633385 is an equidigital number, since it uses as much as digits as its factorization.
106633385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28507.
The product of its (nonzero) digits is 38880, while the sum is 35.
The square root of 106633385 is about 10326.3442224245. The cubic root of 106633385 is about 474.2031107439.
Adding to 106633385 its reverse (583336601), we get a palindrome (689969986).
The spelling of 106633385 in words is "one hundred six million, six hundred thirty-three thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •