Base | Representation |
---|---|
bin | 1100110001011… |
… | …11110000010000 |
3 | 21110121210122120 |
4 | 12120233300100 |
5 | 204412302402 |
6 | 14344334240 |
7 | 2440522461 |
oct | 630576020 |
9 | 243553576 |
10 | 107150352 |
11 | 55535711 |
12 | 2ba74380 |
13 | 1927829a |
14 | 10332d68 |
15 | 96183bc |
hex | 662fc10 |
107150352 has 40 divisors (see below), whose sum is σ = 277244160. Its totient is φ = 35660160.
The previous prime is 107150347. The next prime is 107150357. The reversal of 107150352 is 253051701.
It is an interprime number because it is at equal distance from previous prime (107150347) and next prime (107150357).
It is a super-2 number, since 2×1071503522 = 22962395867447808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (107150357) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38049 + ... + 40767.
It is an arithmetic number, because the mean of its divisors is an integer number (6931104).
Almost surely, 2107150352 is an apocalyptic number.
107150352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107150352 is an abundant number, since it is smaller than the sum of its proper divisors (170093808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107150352 is a wasteful number, since it uses less digits than its factorization.
107150352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3551 (or 3545 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 24.
The square root of 107150352 is about 10351.3454197993. The cubic root of 107150352 is about 474.9682002719.
The spelling of 107150352 in words is "one hundred seven million, one hundred fifty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •