Base | Representation |
---|---|
bin | 11101110010111101100010… |
… | …101001000111000010010001 |
3 | 122011222211002101111222110221 |
4 | 131302331202221013002101 |
5 | 114134021440420042040 |
6 | 1142413232053153041 |
7 | 36413501141065423 |
oct | 3562754251070221 |
9 | 564884071458427 |
10 | 131045402112145 |
11 | 38834052166a54 |
12 | 1284558802b781 |
13 | 58176b3b62931 |
14 | 24508ba428813 |
15 | 1023bd1bcc74a |
hex | 772f62a47091 |
131045402112145 has 32 divisors (see below), whose sum is σ = 166356805852800. Its totient is φ = 98824303259136.
The previous prime is 131045402112091. The next prime is 131045402112173. The reversal of 131045402112145 is 541211204540131.
It is a cyclic number.
It is not a de Polignac number, because 131045402112145 - 27 = 131045402112017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131045402112145.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12495301 + ... + 20450509.
It is an arithmetic number, because the mean of its divisors is an integer number (5198650182900).
Almost surely, 2131045402112145 is an apocalyptic number.
It is an amenable number.
131045402112145 is a deficient number, since it is larger than the sum of its proper divisors (35311403740655).
131045402112145 is a wasteful number, since it uses less digits than its factorization.
131045402112145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7956097.
The product of its (nonzero) digits is 19200, while the sum is 34.
Adding to 131045402112145 its reverse (541211204540131), we get a palindrome (672256606652276).
The spelling of 131045402112145 in words is "one hundred thirty-one trillion, forty-five billion, four hundred two million, one hundred twelve thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •