Base | Representation |
---|---|
bin | 11000001110010000… |
… | …00000001111001101 |
3 | 1020120022011000201101 |
4 | 30013020000033031 |
5 | 203113114044100 |
6 | 5550230143101 |
7 | 640155630526 |
oct | 140710001715 |
9 | 36508130641 |
10 | 13004440525 |
11 | 557373870a |
12 | 262b1b1a91 |
13 | 12c3297c2b |
14 | 8b51a384d |
15 | 511a2c86a |
hex | 3072003cd |
13004440525 has 6 divisors (see below), whose sum is σ = 16125506282. Its totient is φ = 10403552400.
The previous prime is 13004440517. The next prime is 13004440543. The reversal of 13004440525 is 52504440031.
It can be written as a sum of positive squares in 3 ways, for example, as 3781143081 + 9223297444 = 61491^2 + 96038^2 .
It is not a de Polignac number, because 13004440525 - 23 = 13004440517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13004440493 and 13004440502.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 260088786 + ... + 260088835.
Almost surely, 213004440525 is an apocalyptic number.
It is an amenable number.
13004440525 is a deficient number, since it is larger than the sum of its proper divisors (3121065757).
13004440525 is an equidigital number, since it uses as much as digits as its factorization.
13004440525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520177631 (or 520177626 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 13004440525 its reverse (52504440031), we get a palindrome (65508880556).
It can be divided in two parts, 130044 and 40525, that added together give a square (170569 = 4132).
The spelling of 13004440525 in words is "thirteen billion, four million, four hundred forty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •