Base | Representation |
---|---|
bin | 10111011111010000101101… |
… | …001101110110101100011001 |
3 | 111112202200220102122101002022 |
4 | 113133100231031312230121 |
5 | 102020010140333310014 |
6 | 1003412515243144225 |
7 | 30521263242014606 |
oct | 2737205515665431 |
9 | 445680812571068 |
10 | 103303312010009 |
11 | 2aa08763577301 |
12 | b704a5a215075 |
13 | 45845caa00487 |
14 | 1b71c9aa716ad |
15 | be2252348a8e |
hex | 5df42d376b19 |
103303312010009 has 2 divisors, whose sum is σ = 103303312010010. Its totient is φ = 103303312010008.
The previous prime is 103303312009949. The next prime is 103303312010021. The reversal of 103303312010009 is 900010213303301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82203960889600 + 21099351120409 = 9066640^2 + 4593403^2 .
It is an emirp because it is prime and its reverse (900010213303301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103303312010009 - 212 = 103303312005913 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103303312010009.
It is not a weakly prime, because it can be changed into another prime (103303312010029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51651656005004 + 51651656005005.
It is an arithmetic number, because the mean of its divisors is an integer number (51651656005005).
Almost surely, 2103303312010009 is an apocalyptic number.
It is an amenable number.
103303312010009 is a deficient number, since it is larger than the sum of its proper divisors (1).
103303312010009 is an equidigital number, since it uses as much as digits as its factorization.
103303312010009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 26.
The spelling of 103303312010009 in words is "one hundred three trillion, three hundred three billion, three hundred twelve million, ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •