Base | Representation |
---|---|
bin | 1100001110000101010010… |
… | …0010110001100001001001 |
3 | 1202120110212020121212001011 |
4 | 3003201110202301201021 |
5 | 3230114040440310003 |
6 | 44324240444523521 |
7 | 2554503330334432 |
oct | 303412442614111 |
9 | 52513766555034 |
10 | 13436076103753 |
11 | 4310231756876 |
12 | 16100028505a1 |
13 | 76602a4523c4 |
14 | 3464495b2489 |
15 | 18478332646d |
hex | c38548b1849 |
13436076103753 has 2 divisors, whose sum is σ = 13436076103754. Its totient is φ = 13436076103752.
The previous prime is 13436076103661. The next prime is 13436076103763. The reversal of 13436076103753 is 35730167063431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10197631117129 + 3238444986624 = 3193373^2 + 1799568^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13436076103753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13436076103697 and 13436076103706.
It is not a weakly prime, because it can be changed into another prime (13436076103763) 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, 6718038051876 + 6718038051877.
It is an arithmetic number, because the mean of its divisors is an integer number (6718038051877).
Almost surely, 213436076103753 is an apocalyptic number.
It is an amenable number.
13436076103753 is a deficient number, since it is larger than the sum of its proper divisors (1).
13436076103753 is an equidigital number, since it uses as much as digits as its factorization.
13436076103753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2857680, while the sum is 49.
The spelling of 13436076103753 in words is "thirteen trillion, four hundred thirty-six billion, seventy-six million, one hundred three thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •