Base | Representation |
---|---|
bin | 1100110000001… |
… | …01000000000000 |
3 | 21110021220102122 |
4 | 12120011000000 |
5 | 204341201412 |
6 | 14340503412 |
7 | 2436163100 |
oct | 630050000 |
9 | 243256378 |
10 | 106975232 |
11 | 55426091 |
12 | 2b9aab68 |
13 | 19216670 |
14 | 102c9200 |
15 | 95d1572 |
hex | 6605000 |
106975232 has 156 divisors (see below), whose sum is σ = 274529556. Its totient is φ = 41287680.
The previous prime is 106975207. The next prime is 106975259. The reversal of 106975232 is 232579601.
It can be written as a sum of positive squares in 2 ways, for example, as 9834496 + 97140736 = 3136^2 + 9856^2 .
It is a super-2 number, since 2×1069752322 = 22887400522907648, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106975192 and 106975201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2609132 + ... + 2609172.
Almost surely, 2106975232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106975232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137264778).
106975232 is an abundant number, since it is smaller than the sum of its proper divisors (167554324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106975232 is an equidigital number, since it uses as much as digits as its factorization.
106975232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92 (or 63 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 106975232 is about 10342.8831570312. The cubic root of 106975232 is about 474.7093061613.
The spelling of 106975232 in words is "one hundred six million, nine hundred seventy-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •