Base | Representation |
---|---|
bin | 110000001000011001… |
… | …0011011101000000001 |
3 | 100212210101201021102012 |
4 | 1200100302123220001 |
5 | 3143140340332123 |
6 | 115252222102305 |
7 | 10316243622656 |
oct | 1402062335001 |
9 | 325711637365 |
10 | 103360870913 |
11 | 3a920576173 |
12 | 1804741a995 |
13 | 9992bb5261 |
14 | 5007563c2d |
15 | 2a4e313378 |
hex | 1810c9ba01 |
103360870913 has 2 divisors, whose sum is σ = 103360870914. Its totient is φ = 103360870912.
The previous prime is 103360870901. The next prime is 103360870919. The reversal of 103360870913 is 319078063301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98666976769 + 4693894144 = 314113^2 + 68512^2 .
It is a cyclic number.
It is not a de Polignac number, because 103360870913 - 210 = 103360869889 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (103360870919) 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, 51680435456 + 51680435457.
It is an arithmetic number, because the mean of its divisors is an integer number (51680435457).
Almost surely, 2103360870913 is an apocalyptic number.
It is an amenable number.
103360870913 is a deficient number, since it is larger than the sum of its proper divisors (1).
103360870913 is an equidigital number, since it uses as much as digits as its factorization.
103360870913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 41.
The spelling of 103360870913 in words is "one hundred three billion, three hundred sixty million, eight hundred seventy thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •