Base | Representation |
---|---|
bin | 110000010111101100… |
… | …0011100011001001001 |
3 | 100221010011112122201011 |
4 | 1200233120130121021 |
5 | 3200213240331014 |
6 | 115415155323521 |
7 | 10335045503215 |
oct | 1405730343111 |
9 | 327104478634 |
10 | 103874152009 |
11 | 40064283921 |
12 | 1816b2b05a1 |
13 | 9a4533a494 |
14 | 50557b5945 |
15 | 2a7e4017c4 |
hex | 182f61c649 |
103874152009 has 2 divisors, whose sum is σ = 103874152010. Its totient is φ = 103874152008.
The previous prime is 103874152003. The next prime is 103874152013. The reversal of 103874152009 is 900251478301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100316625984 + 3557526025 = 316728^2 + 59645^2 .
It is a cyclic number.
It is not a de Polignac number, because 103874152009 - 217 = 103874020937 is a prime.
It is not a weakly prime, because it can be changed into another prime (103874152003) 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 as a sum of consecutive naturals, namely, 51937076004 + 51937076005.
It is an arithmetic number, because the mean of its divisors is an integer number (51937076005).
Almost surely, 2103874152009 is an apocalyptic number.
It is an amenable number.
103874152009 is a deficient number, since it is larger than the sum of its proper divisors (1).
103874152009 is an equidigital number, since it uses as much as digits as its factorization.
103874152009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 103874152009 in words is "one hundred three billion, eight hundred seventy-four million, one hundred fifty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •