Base | Representation |
---|---|
bin | 10011010010011010100… |
… | …001111011100101011001 |
3 | 11200201012100221001002101 |
4 | 103102122201323211121 |
5 | 133204001240410431 |
6 | 2452522213003401 |
7 | 164521462321000 |
oct | 23223241734531 |
9 | 4621170831071 |
10 | 1325442513241 |
11 | 471131820a40 |
12 | 194a68023561 |
13 | 97cb12089c2 |
14 | 4821a601c37 |
15 | 247278a7961 |
hex | 1349a87b959 |
1325442513241 has 32 divisors (see below), whose sum is σ = 1687657708800. Its totient is φ = 1031934355200.
The previous prime is 1325442513233. The next prime is 1325442513287. The reversal of 1325442513241 is 1423152445231.
It is not a de Polignac number, because 1325442513241 - 23 = 1325442513233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1325442513241.
It is not an unprimeable number, because it can be changed into a prime (1325442510241) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4307185 + ... + 4604641.
It is an arithmetic number, because the mean of its divisors is an integer number (52739303400).
Almost surely, 21325442513241 is an apocalyptic number.
1325442513241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1325442513241 is a deficient number, since it is larger than the sum of its proper divisors (362215195559).
1325442513241 is a wasteful number, since it uses less digits than its factorization.
1325442513241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298670 (or 298656 counting only the distinct ones).
The product of its digits is 115200, while the sum is 37.
Adding to 1325442513241 its reverse (1423152445231), we get a palindrome (2748594958472).
The spelling of 1325442513241 in words is "one trillion, three hundred twenty-five billion, four hundred forty-two million, five hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •