Base | Representation |
---|---|
bin | 1100101110011… |
… | …10010010110000 |
3 | 21102212112001101 |
4 | 12113032102300 |
5 | 204312014102 |
6 | 14332014144 |
7 | 2434240564 |
oct | 627162260 |
9 | 242775041 |
10 | 106751152 |
11 | 552927a2 |
12 | 2b901354 |
13 | 19168681 |
14 | 1026b6a4 |
15 | 9589e87 |
hex | 65ce4b0 |
106751152 has 10 divisors (see below), whose sum is σ = 206830388. Its totient is φ = 53375568.
The previous prime is 106751149. The next prime is 106751171. The reversal of 106751152 is 251157601.
It is a super-2 number, since 2×1067511522 = 22791616906654208, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106751152.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3335958 + ... + 3335989.
Almost surely, 2106751152 is an apocalyptic number.
It is an amenable number.
106751152 is a deficient number, since it is larger than the sum of its proper divisors (100079236).
106751152 is an equidigital number, since it uses as much as digits as its factorization.
106751152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6671955 (or 6671949 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 28.
The square root of 106751152 is about 10332.0449089229. The cubic root of 106751152 is about 474.3776181041.
The spelling of 106751152 in words is "one hundred six million, seven hundred fifty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •