Base | Representation |
---|---|
bin | 10011010010011001110… |
… | …110000001110000101001 |
3 | 11200201011120021022122122 |
4 | 103102121312001300221 |
5 | 133203440314113301 |
6 | 2452521122201025 |
7 | 164521262434643 |
oct | 23223166016051 |
9 | 4621146238578 |
10 | 1325431004201 |
11 | 471126280037 |
12 | 194a641b3175 |
13 | 97caba09315 |
14 | 48218c87893 |
15 | 2472688281b |
hex | 13499d81c29 |
1325431004201 has 8 divisors (see below), whose sum is σ = 1362057576264. Its totient is φ = 1288846753920.
The previous prime is 1325431004171. The next prime is 1325431004207. The reversal of 1325431004201 is 1024001345231.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 677824536601 + 647606467600 = 823301^2 + 804740^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1325431004201 - 226 = 1325363895337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1325431004207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10516940 + ... + 10642221.
It is an arithmetic number, because the mean of its divisors is an integer number (170257197033).
Almost surely, 21325431004201 is an apocalyptic number.
It is an amenable number.
1325431004201 is a deficient number, since it is larger than the sum of its proper divisors (36626572063).
1325431004201 is a wasteful number, since it uses less digits than its factorization.
1325431004201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21160891.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 1325431004201 its reverse (1024001345231), we get a palindrome (2349432349432).
The spelling of 1325431004201 in words is "one trillion, three hundred twenty-five billion, four hundred thirty-one million, four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •