Base | Representation |
---|---|
bin | 1011111011111100001111… |
… | …1110011110100100000101 |
3 | 1201110200101220120000100102 |
4 | 2332333003332132210011 |
5 | 3210012244213241032 |
6 | 43525134435253445 |
7 | 2523131122016444 |
oct | 276770376364405 |
9 | 51420356500312 |
10 | 13124413024517 |
11 | 4200039aaa513 |
12 | 157b72344a285 |
13 | 74281c215ba2 |
14 | 3353214b6d5b |
15 | 17b5e1c9a362 |
hex | befc3f9e905 |
13124413024517 has 2 divisors, whose sum is σ = 13124413024518. Its totient is φ = 13124413024516.
The previous prime is 13124413024487. The next prime is 13124413024549. The reversal of 13124413024517 is 71542031442131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13075463232001 + 48949792516 = 3616001^2 + 221246^2 .
It is a cyclic number.
It is not a de Polignac number, because 13124413024517 - 212 = 13124413020421 is a prime.
It is a super-2 number, since 2×131244130245172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13124413024577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6562206512258 + 6562206512259.
It is an arithmetic number, because the mean of its divisors is an integer number (6562206512259).
Almost surely, 213124413024517 is an apocalyptic number.
It is an amenable number.
13124413024517 is a deficient number, since it is larger than the sum of its proper divisors (1).
13124413024517 is an equidigital number, since it uses as much as digits as its factorization.
13124413024517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80640, while the sum is 38.
Adding to 13124413024517 its reverse (71542031442131), we get a palindrome (84666444466648).
The spelling of 13124413024517 in words is "thirteen trillion, one hundred twenty-four billion, four hundred thirteen million, twenty-four thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •