Base | Representation |
---|---|
bin | 1011111011010110101100… |
… | …1111001110111101100001 |
3 | 1201102201101111200021112111 |
4 | 2332311223033032331201 |
5 | 3204331124040411431 |
6 | 43520350401355321 |
7 | 2522323300245013 |
oct | 276655317167541 |
9 | 51381344607474 |
10 | 13114334310241 |
11 | 41a683791228a |
12 | 1579790038b41 |
13 | 7418a4128628 |
14 | 334a46b041b3 |
15 | 17b20203e7b1 |
hex | bed6b3cef61 |
13114334310241 has 2 divisors, whose sum is σ = 13114334310242. Its totient is φ = 13114334310240.
The previous prime is 13114334310227. The next prime is 13114334310247. The reversal of 13114334310241 is 14201343341131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11636660675025 + 1477673635216 = 3411255^2 + 1215596^2 .
It is a cyclic number.
It is not a de Polignac number, because 13114334310241 - 29 = 13114334309729 is a prime.
It is a super-5 number, since 5×131143343102415 (a number of 67 digits) contains 55555 as substring.
It is not a weakly prime, because it can be changed into another prime (13114334310247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557167155120 + 6557167155121.
It is an arithmetic number, because the mean of its divisors is an integer number (6557167155121).
Almost surely, 213114334310241 is an apocalyptic number.
It is an amenable number.
13114334310241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13114334310241 is an equidigital number, since it uses as much as digits as its factorization.
13114334310241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 13114334310241 its reverse (14201343341131), we get a palindrome (27315677651372).
The spelling of 13114334310241 in words is "thirteen trillion, one hundred fourteen billion, three hundred thirty-four million, three hundred ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •