Base | Representation |
---|---|
bin | 1010001100000111001011… |
… | …1011110110011111111101 |
3 | 1110200000102110221122020012 |
4 | 2203001302323312133331 |
5 | 2432023124432002232 |
6 | 35454402545033005 |
7 | 2234255546164556 |
oct | 243016273663775 |
9 | 43600373848205 |
10 | 11203203000317 |
11 | 362a285032709 |
12 | 130b30a025765 |
13 | 6335c41c2593 |
14 | 2aa348bc332d |
15 | 14664ae209b2 |
hex | a3072ef67fd |
11203203000317 has 2 divisors, whose sum is σ = 11203203000318. Its totient is φ = 11203203000316.
The previous prime is 11203203000271. The next prime is 11203203000359. The reversal of 11203203000317 is 71300030230211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7654994098756 + 3548208901561 = 2766766^2 + 1883669^2 .
It is a cyclic number.
It is not a de Polignac number, because 11203203000317 - 28 = 11203203000061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11203203000292 and 11203203000301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11203203000217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601601500158 + 5601601500159.
It is an arithmetic number, because the mean of its divisors is an integer number (5601601500159).
Almost surely, 211203203000317 is an apocalyptic number.
It is an amenable number.
11203203000317 is a deficient number, since it is larger than the sum of its proper divisors (1).
11203203000317 is an equidigital number, since it uses as much as digits as its factorization.
11203203000317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 11203203000317 its reverse (71300030230211), we get a palindrome (82503233230528).
The spelling of 11203203000317 in words is "eleven trillion, two hundred three billion, two hundred three million, three hundred seventeen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •