Base | Representation |
---|---|
bin | 10011010010000111011… |
… | …001011000001100101101 |
3 | 11200200100222220002020220 |
4 | 103102013121120030231 |
5 | 133202322101112140 |
6 | 2452430304401553 |
7 | 164510513640063 |
oct | 23220731301455 |
9 | 4620328802226 |
10 | 1325121504045 |
11 | 470a875a7a89 |
12 | 1949986162b9 |
13 | 97c5c863331 |
14 | 481c9b20033 |
15 | 247095e8bd0 |
hex | 1348765832d |
1325121504045 has 64 divisors (see below), whose sum is σ = 2271711744000. Its totient is φ = 657588983040.
The previous prime is 1325121504019. The next prime is 1325121504127. The reversal of 1325121504045 is 5404051215231.
It is not a de Polignac number, because 1325121504045 - 25 = 1325121504013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1325121503997 and 1325121504015.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 11818156 + ... + 11929754.
It is an arithmetic number, because the mean of its divisors is an integer number (35495496000).
Almost surely, 21325121504045 is an apocalyptic number.
1325121504045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1325121504045 is a deficient number, since it is larger than the sum of its proper divisors (946590239955).
1325121504045 is a wasteful number, since it uses less digits than its factorization.
1325121504045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112370.
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 1325121504045 its reverse (5404051215231), we get a palindrome (6729172719276).
The spelling of 1325121504045 in words is "one trillion, three hundred twenty-five billion, one hundred twenty-one million, five hundred four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •