Base | Representation |
---|---|
bin | 1011110101010110001111… |
… | …0010110011000010001011 |
3 | 1201001212000000221021121122 |
4 | 2331111203302303002023 |
5 | 3201133243312401303 |
6 | 43401121455225455 |
7 | 2512010635630562 |
oct | 275254362630213 |
9 | 51055000837548 |
10 | 13011130200203 |
11 | 4166a97886963 |
12 | 156178921828b |
13 | 734c3786b6b5 |
14 | 32da56308bd9 |
15 | 1786b1893e38 |
hex | bd563cb308b |
13011130200203 has 2 divisors, whose sum is σ = 13011130200204. Its totient is φ = 13011130200202.
The previous prime is 13011130200193. The next prime is 13011130200209. The reversal of 13011130200203 is 30200203111031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13011130200203 is a prime.
It is a super-2 number, since 2×130111302002032 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13011130200209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6505565100101 + 6505565100102.
It is an arithmetic number, because the mean of its divisors is an integer number (6505565100102).
Almost surely, 213011130200203 is an apocalyptic number.
13011130200203 is a deficient number, since it is larger than the sum of its proper divisors (1).
13011130200203 is an equidigital number, since it uses as much as digits as its factorization.
13011130200203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13011130200203 its reverse (30200203111031), we get a palindrome (43211333311234).
The spelling of 13011130200203 in words is "thirteen trillion, eleven billion, one hundred thirty million, two hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •