Base | Representation |
---|---|
bin | 1100101101011… |
… | …11010110110001 |
3 | 21102122002020002 |
4 | 12112233112301 |
5 | 204243440213 |
6 | 14325155345 |
7 | 2433202256 |
oct | 626572661 |
9 | 242562202 |
10 | 106624433 |
11 | 55206573 |
12 | 2b85bb55 |
13 | 19122aa6 |
14 | 1023742d |
15 | 9562658 |
hex | 65af5b1 |
106624433 has 4 divisors (see below), whose sum is σ = 106653300. Its totient is φ = 106595568.
The previous prime is 106624423. The next prime is 106624439. The reversal of 106624433 is 334426601.
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 10349089 + 96275344 = 3217^2 + 9812^2 .
It is a cyclic number.
It is not a de Polignac number, because 106624433 - 26 = 106624369 is a prime.
It is a super-2 number, since 2×1066244332 = 22737539425142978, 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 = 106624396 and 106624405.
It is not an unprimeable number, because it can be changed into a prime (106624439) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7910 + ... + 16607.
It is an arithmetic number, because the mean of its divisors is an integer number (26663325).
Almost surely, 2106624433 is an apocalyptic number.
It is an amenable number.
106624433 is a deficient number, since it is larger than the sum of its proper divisors (28867).
106624433 is an equidigital number, since it uses as much as digits as its factorization.
106624433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28866.
The product of its (nonzero) digits is 10368, while the sum is 29.
The square root of 106624433 is about 10325.9107588629. The cubic root of 106624433 is about 474.1898404000.
The spelling of 106624433 in words is "one hundred six million, six hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •