Base | Representation |
---|---|
bin | 1100001101011010001010… |
… | …1111010110011001110101 |
3 | 1202112100222201000102221202 |
4 | 3003112202233112121311 |
5 | 3224421340244342100 |
6 | 44315044231422245 |
7 | 2553613462530446 |
oct | 303264257263165 |
9 | 52470881012852 |
10 | 13424503121525 |
11 | 4306333043a51 |
12 | 1609912b24985 |
13 | 764c048cb922 |
14 | 345a6c58d2cd |
15 | 1843073047d5 |
hex | c35a2bd6675 |
13424503121525 has 24 divisors (see below), whose sum is σ = 16855661023560. Its totient is φ = 10604903823360.
The previous prime is 13424503121507. The next prime is 13424503121527. The reversal of 13424503121525 is 52512130542431.
It can be written as a sum of positive squares in 12 ways, for example, as 1325173950244 + 12099329171281 = 1151162^2 + 3478409^2 .
It is not a de Polignac number, because 13424503121525 - 218 = 13424502859381 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13424503121527) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2300804 + ... + 5669453.
It is an arithmetic number, because the mean of its divisors is an integer number (702319209315).
Almost surely, 213424503121525 is an apocalyptic number.
It is an amenable number.
13424503121525 is a deficient number, since it is larger than the sum of its proper divisors (3431157902035).
13424503121525 is an equidigital number, since it uses as much as digits as its factorization.
13424503121525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7971113 (or 7971108 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 13424503121525 its reverse (52512130542431), we get a palindrome (65936633663956).
The spelling of 13424503121525 in words is "thirteen trillion, four hundred twenty-four billion, five hundred three million, one hundred twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •