Base | Representation |
---|---|
bin | 1100101001111… |
… | …10101010001110 |
3 | 21101202122000200 |
4 | 12110332222032 |
5 | 204134202310 |
6 | 14311234330 |
7 | 2426240424 |
oct | 624765216 |
9 | 241678020 |
10 | 106162830 |
11 | 54a20784 |
12 | 2b6789a6 |
13 | 18cc0957 |
14 | 10157114 |
15 | 94c09c0 |
hex | 653ea8e |
106162830 has 48 divisors (see below), whose sum is σ = 280715760. Its totient is φ = 27828864.
The previous prime is 106162813. The next prime is 106162831. The reversal of 106162830 is 38261601.
106162830 is a `hidden beast` number, since 1 + 0 + 6 + 1 + 628 + 30 = 666.
It is a super-2 number, since 2×1061628302 = 22541092947217800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106162794 and 106162803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106162831) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4687 + ... + 15306.
It is an arithmetic number, because the mean of its divisors is an integer number (5848245).
Almost surely, 2106162830 is an apocalyptic number.
106162830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106162830 is an abundant number, since it is smaller than the sum of its proper divisors (174552930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106162830 is a wasteful number, since it uses less digits than its factorization.
106162830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20065 (or 20062 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 106162830 is about 10303.5348303386. The cubic root of 106162830 is about 473.5045562961.
The spelling of 106162830 in words is "one hundred six million, one hundred sixty-two thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •