Base | Representation |
---|---|
bin | 1100011000101… |
… | …00101001101101 |
3 | 21020111100020121 |
4 | 12030110221231 |
5 | 203044043423 |
6 | 14150444541 |
7 | 2401036555 |
oct | 614245155 |
9 | 236440217 |
10 | 103893613 |
11 | 5371089a |
12 | 2a963751 |
13 | 186a7b15 |
14 | db26165 |
15 | 91c345d |
hex | 6314a6d |
103893613 has 4 divisors (see below), whose sum is σ = 110005020. Its totient is φ = 97782208.
The previous prime is 103893589. The next prime is 103893619. The reversal of 103893613 is 316398301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 316398301 = 251 ⋅1260551.
It can be written as a sum of positive squares in 2 ways, for example, as 61669609 + 42224004 = 7853^2 + 6498^2 .
It is a cyclic number.
It is not a de Polignac number, because 103893613 - 213 = 103885421 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 (103893619) 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, 3055678 + ... + 3055711.
It is an arithmetic number, because the mean of its divisors is an integer number (27501255).
Almost surely, 2103893613 is an apocalyptic number.
It is an amenable number.
103893613 is a deficient number, since it is larger than the sum of its proper divisors (6111407).
103893613 is an equidigital number, since it uses as much as digits as its factorization.
103893613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6111406.
The product of its (nonzero) digits is 11664, while the sum is 34.
The square root of 103893613 is about 10192.8216407431. The cubic root of 103893613 is about 470.1065293457.
The spelling of 103893613 in words is "one hundred three million, eight hundred ninety-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •