Base | Representation |
---|---|
bin | 1011111011111011111101… |
… | …0101101100010101001001 |
3 | 1201110200012111011100021212 |
4 | 2332332333111230111021 |
5 | 3210012114304133022 |
6 | 43525123015542505 |
7 | 2523126155514254 |
oct | 276767725542511 |
9 | 51420174140255 |
10 | 13124335224137 |
11 | 41aaaaa0a0985 |
12 | 157b70138aa35 |
13 | 742809075a67 |
14 | 33531502409b |
15 | 17b5da02d3e2 |
hex | befbf56c549 |
13124335224137 has 2 divisors, whose sum is σ = 13124335224138. Its totient is φ = 13124335224136.
The previous prime is 13124335224041. The next prime is 13124335224157. The reversal of 13124335224137 is 73142253342131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10202249257216 + 2922085966921 = 3194096^2 + 1709411^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13124335224137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13124335224094 and 13124335224103.
It is not a weakly prime, because it can be changed into another prime (13124335224157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6562167612068 + 6562167612069.
It is an arithmetic number, because the mean of its divisors is an integer number (6562167612069).
Almost surely, 213124335224137 is an apocalyptic number.
It is an amenable number.
13124335224137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13124335224137 is an equidigital number, since it uses as much as digits as its factorization.
13124335224137 is an evil number, because the sum of its binary digits is even.
The product of its digits is 362880, while the sum is 41.
Adding to 13124335224137 its reverse (73142253342131), we get a palindrome (86266588566268).
The spelling of 13124335224137 in words is "thirteen trillion, one hundred twenty-four billion, three hundred thirty-five million, two hundred twenty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •