Base | Representation |
---|---|
bin | 1100110011011… |
… | …00111110001111 |
3 | 21111002112121122 |
4 | 12121230332033 |
5 | 204443313403 |
6 | 14353551155 |
7 | 2442615515 |
oct | 631547617 |
9 | 244075548 |
10 | 107401103 |
11 | 55697047 |
12 | 2bb754bb |
13 | 19335464 |
14 | 1039a4b5 |
15 | 9667838 |
hex | 666cf8f |
107401103 has 8 divisors (see below), whose sum is σ = 108176640. Its totient is φ = 106628760.
The previous prime is 107401097. The next prime is 107401109. The reversal of 107401103 is 301104701.
It is an interprime number because it is at equal distance from previous prime (107401097) and next prime (107401109).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 107401103 - 26 = 107401039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107401109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136076 + ... + 136862.
It is an arithmetic number, because the mean of its divisors is an integer number (13522080).
Almost surely, 2107401103 is an apocalyptic number.
107401103 is a deficient number, since it is larger than the sum of its proper divisors (775537).
107401103 is an equidigital number, since it uses as much as digits as its factorization.
107401103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1597.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 107401103 is about 10363.4503424294. The cubic root of 107401103 is about 475.3384151629.
Adding to 107401103 its reverse (301104701), we get a palindrome (408505804).
The spelling of 107401103 in words is "one hundred seven million, four hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •