Base | Representation |
---|---|
bin | 11101110110111101100100… |
… | …000001100101011100100101 |
3 | 122012222002122201102210100211 |
4 | 131312331210001211130211 |
5 | 114203022440110243300 |
6 | 1143143414153535421 |
7 | 36442402350636043 |
oct | 3566754401453445 |
9 | 565862581383324 |
10 | 131320303212325 |
11 | 3892a69a717337 |
12 | 1288a907a14571 |
13 | 58375b3b0b216 |
14 | 245dd17ddb393 |
15 | 102ae20b804ba |
hex | 776f64065725 |
131320303212325 has 6 divisors (see below), whose sum is σ = 162837175983314. Its totient is φ = 105056242569840.
The previous prime is 131320303212323. The next prime is 131320303212349. The reversal of 131320303212325 is 523212303023131.
It can be written as a sum of positive squares in 3 ways, for example, as 26704596187201 + 104615707025124 = 5167649^2 + 10228182^2 .
It is not a de Polignac number, because 131320303212325 - 21 = 131320303212323 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131320303212323) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2626406064222 + ... + 2626406064271.
Almost surely, 2131320303212325 is an apocalyptic number.
It is an amenable number.
131320303212325 is a deficient number, since it is larger than the sum of its proper divisors (31516872770989).
131320303212325 is an equidigital number, since it uses as much as digits as its factorization.
131320303212325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5252812128503 (or 5252812128498 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 131320303212325 its reverse (523212303023131), we get a palindrome (654532606235456).
The spelling of 131320303212325 in words is "one hundred thirty-one trillion, three hundred twenty billion, three hundred three million, two hundred twelve thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •