Base | Representation |
---|---|
bin | 1100010001111111110011… |
… | …1001110111101011000101 |
3 | 1202210220102221201221021020 |
4 | 3010133330321313223011 |
5 | 3232214302230140010 |
6 | 44415201511141353 |
7 | 2562403662505236 |
oct | 304377471675305 |
9 | 52726387657236 |
10 | 13503325240005 |
11 | 4336801081227 |
12 | 1621050374859 |
13 | 76c4869b4a13 |
14 | 3497c8b1508d |
15 | 1863bc1a6470 |
hex | c47fce77ac5 |
13503325240005 has 128 divisors (see below), whose sum is σ = 22749394821120. Its totient is φ = 6833872281600.
The previous prime is 13503325239997. The next prime is 13503325240019. The reversal of 13503325240005 is 50004252330531.
It is not a de Polignac number, because 13503325240005 - 23 = 13503325239997 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 838864117 + ... + 838880213.
It is an arithmetic number, because the mean of its divisors is an integer number (177729647040).
Almost surely, 213503325240005 is an apocalyptic number.
13503325240005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13503325240005 is a deficient number, since it is larger than the sum of its proper divisors (9246069581115).
13503325240005 is a wasteful number, since it uses less digits than its factorization.
13503325240005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16491.
The product of its (nonzero) digits is 54000, while the sum is 33.
Adding to 13503325240005 its reverse (50004252330531), we get a palindrome (63507577570536).
The spelling of 13503325240005 in words is "thirteen trillion, five hundred three billion, three hundred twenty-five million, two hundred forty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •