Base | Representation |
---|---|
bin | 10011010001100011100… |
… | …010110101111000010001 |
3 | 11200121211002001202212120 |
4 | 103101203202311320101 |
5 | 133200104110131022 |
6 | 2452250500244453 |
7 | 164456561166000 |
oct | 23214342657021 |
9 | 4617732052776 |
10 | 1324520005137 |
11 | 4707a9015a4a |
12 | 19484b0a0729 |
13 | 97b95061414 |
14 | 4816dca6c37 |
15 | 246c18d1d5c |
hex | 134638b5e11 |
1324520005137 has 32 divisors (see below), whose sum is σ = 2062900224000. Its totient is φ = 755621317584.
The previous prime is 1324520005121. The next prime is 1324520005141. The reversal of 1324520005137 is 7315000254231.
It is not a de Polignac number, because 1324520005137 - 24 = 1324520005121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1324520005098 and 1324520005107.
It is not an unprimeable number, because it can be changed into a prime (1324520005147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 435687 + ... + 1684892.
It is an arithmetic number, because the mean of its divisors is an integer number (64465632000).
Almost surely, 21324520005137 is an apocalyptic number.
It is an amenable number.
1324520005137 is a deficient number, since it is larger than the sum of its proper divisors (738380218863).
1324520005137 is an equidigital number, since it uses as much as digits as its factorization.
1324520005137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2121210 (or 2121196 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 33.
Adding to 1324520005137 its reverse (7315000254231), we get a palindrome (8639520259368).
The spelling of 1324520005137 in words is "one trillion, three hundred twenty-four billion, five hundred twenty million, five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •