Base | Representation |
---|---|
bin | 1100110000011… |
… | …10000110101000 |
3 | 21110100210120200 |
4 | 12120032012220 |
5 | 204343400040 |
6 | 14341352200 |
7 | 2436406566 |
oct | 630160650 |
9 | 243323520 |
10 | 107012520 |
11 | 554510aa |
12 | 2ba08660 |
13 | 1922a624 |
14 | 102d8a36 |
15 | 95dc630 |
hex | 660e1a8 |
107012520 has 48 divisors (see below), whose sum is σ = 347791860. Its totient is φ = 28536576.
The previous prime is 107012513. The next prime is 107012533. The reversal of 107012520 is 25210701.
It can be written as a sum of positive squares in 2 ways, for example, as 104407524 + 2604996 = 10218^2 + 1614^2 .
It is a super-2 number, since 2×1070125202 = 22903358873500800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 107012493 and 107012502.
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, 148269 + ... + 148988.
Almost surely, 2107012520 is an apocalyptic number.
107012520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107012520 is an abundant number, since it is smaller than the sum of its proper divisors (240779340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107012520 is a wasteful number, since it uses less digits than its factorization.
107012520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297274 (or 297267 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 107012520 is about 10344.6855921289. The cubic root of 107012520 is about 474.7644557008.
The spelling of 107012520 in words is "one hundred seven million, twelve thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •