Base | Representation |
---|---|
bin | 1100101100100… |
… | …10001111000000 |
3 | 21102102000121021 |
4 | 12112102033000 |
5 | 204231131102 |
6 | 14322435224 |
7 | 2432164435 |
oct | 626221700 |
9 | 242360537 |
10 | 106505152 |
11 | 55134996 |
12 | 2b802b14 |
13 | 190b0700 |
14 | 10205b8c |
15 | 953c137 |
hex | 65923c0 |
106505152 has 84 divisors (see below), whose sum is σ = 235198920. Its totient is φ = 47803392.
The previous prime is 106505141. The next prime is 106505173. The reversal of 106505152 is 251505601.
It is a super-2 number, since 2×1065051522 = 22686694805086208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 464974 + ... + 465202.
Almost surely, 2106505152 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 106505152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117599460).
106505152 is an abundant number, since it is smaller than the sum of its proper divisors (128693768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106505152 is a wasteful number, since it uses less digits than its factorization.
106505152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310 (or 287 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 106505152 is about 10320.1333324720. The cubic root of 106505152 is about 474.0129486632.
The spelling of 106505152 in words is "one hundred six million, five hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •