Base | Representation |
---|---|
bin | 1100010110011… |
… | …10011111010111 |
3 | 21012221202000211 |
4 | 12023032133113 |
5 | 203010344411 |
6 | 14140350251 |
7 | 2365431661 |
oct | 613163727 |
9 | 235852024 |
10 | 103606231 |
11 | 53534993 |
12 | 2a845387 |
13 | 18607081 |
14 | da8d531 |
15 | 9168221 |
hex | 62ce7d7 |
103606231 has 4 divisors (see below), whose sum is σ = 104148864. Its totient is φ = 103063600.
The previous prime is 103606207. The next prime is 103606273. The reversal of 103606231 is 132606301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132606301 = 19 ⋅6979279.
It is not a de Polignac number, because 103606231 - 211 = 103604183 is a prime.
It is a super-3 number, since 3×1036062313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103601231) 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 3 ways as a sum of consecutive naturals, for example, 271030 + ... + 271411.
It is an arithmetic number, because the mean of its divisors is an integer number (26037216).
Almost surely, 2103606231 is an apocalyptic number.
103606231 is a deficient number, since it is larger than the sum of its proper divisors (542633).
103606231 is an equidigital number, since it uses as much as digits as its factorization.
103606231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542632.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 103606231 is about 10178.7146045068. The cubic root of 103606231 is about 469.6726723448.
The spelling of 103606231 in words is "one hundred three million, six hundred six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •