Base | Representation |
---|---|
bin | 1100110101101… |
… | …11110000000001 |
3 | 21111200002202201 |
4 | 12122313300001 |
5 | 210033114033 |
6 | 14404313201 |
7 | 2445332503 |
oct | 632676001 |
9 | 244602681 |
10 | 107707393 |
11 | 55886182 |
12 | 300a2801 |
13 | 194119b1 |
14 | 10439d73 |
15 | 96c847d |
hex | 66b7c01 |
107707393 has 4 divisors (see below), whose sum is σ = 114043140. Its totient is φ = 101371648.
The previous prime is 107707387. The next prime is 107707399. The reversal of 107707393 is 393707701.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (107707387) and next prime (107707399).
It can be written as a sum of positive squares in 2 ways, for example, as 57410929 + 50296464 = 7577^2 + 7092^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107707393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (107707399) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 3167848 + ... + 3167881.
It is an arithmetic number, because the mean of its divisors is an integer number (28510785).
Almost surely, 2107707393 is an apocalyptic number.
It is an amenable number.
107707393 is a deficient number, since it is larger than the sum of its proper divisors (6335747).
107707393 is an equidigital number, since it uses as much as digits as its factorization.
107707393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6335746.
The product of its (nonzero) digits is 27783, while the sum is 37.
The square root of 107707393 is about 10378.2172361153. The cubic root of 107707393 is about 475.7898482090.
The spelling of 107707393 in words is "one hundred seven million, seven hundred seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •