Base | Representation |
---|---|
bin | 1100101111101… |
… | …10111011111110 |
3 | 21110011222102020 |
4 | 12113312323332 |
5 | 204332331010 |
6 | 14335341010 |
7 | 2435533131 |
oct | 627667376 |
9 | 243158366 |
10 | 106917630 |
11 | 55396886 |
12 | 2b981766 |
13 | 191c6391 |
14 | 102b2218 |
15 | 95be470 |
hex | 65f6efe |
106917630 has 32 divisors (see below), whose sum is σ = 257568768. Its totient is φ = 28404000.
The previous prime is 106917623. The next prime is 106917637. The reversal of 106917630 is 36719601.
It is an interprime number because it is at equal distance from previous prime (106917623) and next prime (106917637).
It is a super-2 number, since 2×1069176302 = 22862759209633800, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106917591 and 106917600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106917637) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1555 + ... + 14705.
It is an arithmetic number, because the mean of its divisors is an integer number (8049024).
Almost surely, 2106917630 is an apocalyptic number.
106917630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106917630 is an abundant number, since it is smaller than the sum of its proper divisors (150651138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106917630 is a wasteful number, since it uses less digits than its factorization.
106917630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13432.
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 106917630 is about 10340.0981620099. The cubic root of 106917630 is about 474.6240867002.
The spelling of 106917630 in words is "one hundred six million, nine hundred seventeen thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •