Base | Representation |
---|---|
bin | 1100010110010… |
… | …01110010100101 |
3 | 21012220202121212 |
4 | 12023021302211 |
5 | 203004240411 |
6 | 14140121205 |
7 | 2365321601 |
oct | 613116245 |
9 | 235822555 |
10 | 103586981 |
11 | 53521483 |
12 | 2a836205 |
13 | 185cb394 |
14 | da86501 |
15 | 916268b |
hex | 62c9ca5 |
103586981 has 2 divisors, whose sum is σ = 103586982. Its totient is φ = 103586980.
The previous prime is 103586969. The next prime is 103586983. The reversal of 103586981 is 189685301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78676900 + 24910081 = 8870^2 + 4991^2 .
It is a cyclic number.
It is not a de Polignac number, because 103586981 - 222 = 99392677 is a prime.
It is a super-3 number, since 3×1035869813 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 103586983, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103586983) 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 as a sum of consecutive naturals, namely, 51793490 + 51793491.
It is an arithmetic number, because the mean of its divisors is an integer number (51793491).
Almost surely, 2103586981 is an apocalyptic number.
It is an amenable number.
103586981 is a deficient number, since it is larger than the sum of its proper divisors (1).
103586981 is an equidigital number, since it uses as much as digits as its factorization.
103586981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 41.
The square root of 103586981 is about 10177.7689598458. The cubic root of 103586981 is about 469.6435822059.
The spelling of 103586981 in words is "one hundred three million, five hundred eighty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •