Base | Representation |
---|---|
bin | 1011111100110110010100… |
… | …1001110010000010010101 |
3 | 1201112011122100000010000222 |
4 | 2333031211021302002111 |
5 | 3210241211004142100 |
6 | 43540233353444125 |
7 | 2524222333220351 |
oct | 277154511620225 |
9 | 51464570003028 |
10 | 13140002021525 |
11 | 4206709644715 |
12 | 1582754110645 |
13 | 744134aa7582 |
14 | 335d9da1c461 |
15 | 17bc05657485 |
hex | bf365272095 |
13140002021525 has 12 divisors (see below), whose sum is σ = 16330717788000. Its totient is φ = 10488056274480.
The previous prime is 13140002021513. The next prime is 13140002021539. The reversal of 13140002021525 is 52512020004131.
13140002021525 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13140002021525 - 210 = 13140002020501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13140002021494 and 13140002021503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 598622375 + ... + 598644324.
It is an arithmetic number, because the mean of its divisors is an integer number (1360893149000).
Almost surely, 213140002021525 is an apocalyptic number.
It is an amenable number.
13140002021525 is a deficient number, since it is larger than the sum of its proper divisors (3190715766475).
13140002021525 is a wasteful number, since it uses less digits than its factorization.
13140002021525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1197267148 (or 1197267143 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 13140002021525 its reverse (52512020004131), we get a palindrome (65652022025656).
The spelling of 13140002021525 in words is "thirteen trillion, one hundred forty billion, two million, twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •