Base | Representation |
---|---|
bin | 11101110010011110101001… |
… | …000101011011101000101001 |
3 | 122011212122110011102120201102 |
4 | 131302132221011123220221 |
5 | 114133001013344001210 |
6 | 1142350103535331145 |
7 | 36411215022365264 |
oct | 3562365105335051 |
9 | 564778404376642 |
10 | 131012224203305 |
11 | 38820a77098a85 |
12 | 1283b068980ab5 |
13 | 5814527295203 |
14 | 244d04dd05cdb |
15 | 1022dde0baea5 |
hex | 7727a915ba29 |
131012224203305 has 16 divisors (see below), whose sum is σ = 159369565161744. Its totient is φ = 103373204843520.
The previous prime is 131012224203271. The next prime is 131012224203307. The reversal of 131012224203305 is 503302422210131.
It can be written as a sum of positive squares in 8 ways, for example, as 25776304699369 + 105235919503936 = 5077037^2 + 10258456^2 .
It is not a de Polignac number, because 131012224203305 - 246 = 60643480025641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131012224203307) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46624085 + ... + 49354125.
It is an arithmetic number, because the mean of its divisors is an integer number (9960597822609).
Almost surely, 2131012224203305 is an apocalyptic number.
It is an amenable number.
131012224203305 is a deficient number, since it is larger than the sum of its proper divisors (28357340958439).
131012224203305 is a wasteful number, since it uses less digits than its factorization.
131012224203305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2861596.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 131012224203305 its reverse (503302422210131), we get a palindrome (634314646413436).
The spelling of 131012224203305 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-four million, two hundred three thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •