Base | Representation |
---|---|
bin | 1100010100001101010110… |
… | …1101010101111010100011 |
3 | 1202221112112001000010112102 |
4 | 3011003111231111322203 |
5 | 3233330112010201433 |
6 | 44444444141121015 |
7 | 2565220406560262 |
oct | 305032555257243 |
9 | 52845461003472 |
10 | 13541322350243 |
11 | 435092a499576 |
12 | 162849555916b |
13 | 772c30b1a7bc |
14 | 34b5912b45d9 |
15 | 187392e094e8 |
hex | c50d5b55ea3 |
13541322350243 has 2 divisors, whose sum is σ = 13541322350244. Its totient is φ = 13541322350242.
The previous prime is 13541322350239. The next prime is 13541322350267. The reversal of 13541322350243 is 34205322314531.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13541322350243 - 22 = 13541322350239 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 13541322350197 and 13541322350206.
It is not a weakly prime, because it can be changed into another prime (13541322355243) 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, 6770661175121 + 6770661175122.
It is an arithmetic number, because the mean of its divisors is an integer number (6770661175122).
Almost surely, 213541322350243 is an apocalyptic number.
13541322350243 is a deficient number, since it is larger than the sum of its proper divisors (1).
13541322350243 is an equidigital number, since it uses as much as digits as its factorization.
13541322350243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 38.
Adding to 13541322350243 its reverse (34205322314531), we get a palindrome (47746644664774).
The spelling of 13541322350243 in words is "thirteen trillion, five hundred forty-one billion, three hundred twenty-two million, three hundred fifty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •