Base | Representation |
---|---|
bin | 1100110011000… |
… | …00100100110001 |
3 | 21110222221221211 |
4 | 12121200210301 |
5 | 204440202241 |
6 | 14352520121 |
7 | 2442314461 |
oct | 631404461 |
9 | 243887854 |
10 | 107350321 |
11 | 55661981 |
12 | 2bb50041 |
13 | 19318300 |
14 | 10385ba1 |
15 | 9657781 |
hex | 6660931 |
107350321 has 9 divisors (see below), whose sum is σ = 116389281. Its totient is φ = 98968272.
The previous prime is 107350289. The next prime is 107350337. The reversal of 107350321 is 123053701.
The square root of 107350321 is 10361.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 16719921 + 90630400 = 4089^2 + 9520^2 .
It is not a de Polignac number, because 107350321 - 25 = 107350289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 107350292 and 107350301.
It is not an unprimeable number, because it can be changed into a prime (107350421) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 134295 + ... + 135091.
Almost surely, 2107350321 is an apocalyptic number.
107350321 is the 10361-st square number.
107350321 is the 5181-st centered octagonal number.
It is an amenable number.
107350321 is a deficient number, since it is larger than the sum of its proper divisors (9038960).
107350321 is an frugal number, since it uses more digits than its factorization.
107350321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1620 (or 810 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 22.
The cubic root of 107350321 is about 475.2634859484.
The spelling of 107350321 in words is "one hundred seven million, three hundred fifty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •