Base | Representation |
---|---|
bin | 10011010010100110010… |
… | …101010100100011001001 |
3 | 11200201201011112112210121 |
4 | 103102212111110203021 |
5 | 133204402434043332 |
6 | 2452554005143241 |
7 | 164526415423426 |
oct | 23224625244311 |
9 | 4621634475717 |
10 | 1325640534217 |
11 | 47122358203a |
12 | 194b023bab21 |
13 | 9801324c28c |
14 | 48238a2ad4d |
15 | 24739e70797 |
hex | 134a65548c9 |
1325640534217 has 4 divisors (see below), whose sum is σ = 1326001452820. Its totient is φ = 1325279615616.
The previous prime is 1325640534199. The next prime is 1325640534299. The reversal of 1325640534217 is 7124350465231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40582505401 + 1285058028816 = 201451^2 + 1133604^2 .
It is a cyclic number.
It is not a de Polignac number, because 1325640534217 - 211 = 1325640532169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1325640534917) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 180453792 + ... + 180461137.
It is an arithmetic number, because the mean of its divisors is an integer number (331500363205).
Almost surely, 21325640534217 is an apocalyptic number.
It is an amenable number.
1325640534217 is a deficient number, since it is larger than the sum of its proper divisors (360918603).
1325640534217 is an equidigital number, since it uses as much as digits as its factorization.
1325640534217 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 360918602.
The product of its (nonzero) digits is 604800, while the sum is 43.
Adding to 1325640534217 its reverse (7124350465231), we get a palindrome (8449990999448).
The spelling of 1325640534217 in words is "one trillion, three hundred twenty-five billion, six hundred forty million, five hundred thirty-four thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •