Base | Representation |
---|---|
bin | 11101110011110100010101… |
… | …001100100000011000100001 |
3 | 122012012102221100220200210002 |
4 | 131303310111030200120201 |
5 | 114141002431432412210 |
6 | 1142500241452345345 |
7 | 36420653044400222 |
oct | 3563642514403041 |
9 | 565172840820702 |
10 | 131104232310305 |
11 | 38856aa1293631 |
12 | 12854a66175255 |
13 | 58200cb13c887 |
14 | 245369b7ad249 |
15 | 10254c68ac4a5 |
hex | 773d15320621 |
131104232310305 has 8 divisors (see below), whose sum is σ = 159904178424744. Its totient is φ = 103163986080000.
The previous prime is 131104232310221. The next prime is 131104232310347. The reversal of 131104232310305 is 503013232401131.
It can be written as a sum of positive squares in 4 ways, for example, as 13037905526416 + 118066326783889 = 3610804^2 + 10865833^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131104232310305 - 214 = 131104232293921 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 214924970696 + ... + 214924971305.
It is an arithmetic number, because the mean of its divisors is an integer number (19988022303093).
Almost surely, 2131104232310305 is an apocalyptic number.
It is an amenable number.
131104232310305 is a deficient number, since it is larger than the sum of its proper divisors (28799946114439).
131104232310305 is an equidigital number, since it uses as much as digits as its factorization.
131104232310305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429849942067.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 131104232310305 its reverse (503013232401131), we get a palindrome (634117464711436).
The spelling of 131104232310305 in words is "one hundred thirty-one trillion, one hundred four billion, two hundred thirty-two million, three hundred ten thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •