Base | Representation |
---|---|
bin | 1011111100111011001011… |
… | …0000111111010010001101 |
3 | 1201112022000002011211200201 |
4 | 2333032302300333102031 |
5 | 3210301342330120122 |
6 | 43541010510453501 |
7 | 2524266524123665 |
oct | 277166260772215 |
9 | 51468002154621 |
10 | 13141304145037 |
11 | 4207217662352 |
12 | 1582a58204291 |
13 | 7442b17a6c63 |
14 | 3360849331a5 |
15 | 17bc7eb16a27 |
hex | bf3b2c3f48d |
13141304145037 has 2 divisors, whose sum is σ = 13141304145038. Its totient is φ = 13141304145036.
The previous prime is 13141304144999. The next prime is 13141304145071. The reversal of 13141304145037 is 73054140314131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10563189011236 + 2578115133801 = 3250106^2 + 1605651^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13141304145037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13141304144987 and 13141304145005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13141304145337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6570652072518 + 6570652072519.
It is an arithmetic number, because the mean of its divisors is an integer number (6570652072519).
Almost surely, 213141304145037 is an apocalyptic number.
It is an amenable number.
13141304145037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13141304145037 is an equidigital number, since it uses as much as digits as its factorization.
13141304145037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 13141304145037 its reverse (73054140314131), we get a palindrome (86195444459168).
The spelling of 13141304145037 in words is "thirteen trillion, one hundred forty-one billion, three hundred four million, one hundred forty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •