Base | Representation |
---|---|
bin | 11101110100000101111011… |
… | …000011101001001001000101 |
3 | 122012021020200202120021002112 |
4 | 131310011323003221021011 |
5 | 114141310123002211401 |
6 | 1142513044045350405 |
7 | 36422222114623430 |
oct | 3564057303511105 |
9 | 565236622507075 |
10 | 131123121132101 |
11 | 38864004562a5a |
12 | 12858657b68405 |
13 | 5821b1b5518c7 |
14 | 2454570286817 |
15 | 1025c2ecd53bb |
hex | 77417b0e9245 |
131123121132101 has 16 divisors (see below), whose sum is σ = 153540965464320. Its totient is φ = 109627875342720.
The previous prime is 131123121132079. The next prime is 131123121132253. The reversal of 131123121132101 is 101231121321131.
It is not a de Polignac number, because 131123121132101 - 26 = 131123121132037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131123121132001) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 44661161 + ... + 47506478.
It is an arithmetic number, because the mean of its divisors is an integer number (9596310341520).
Almost surely, 2131123121132101 is an apocalyptic number.
It is an amenable number.
131123121132101 is a deficient number, since it is larger than the sum of its proper divisors (22417844332219).
131123121132101 is an equidigital number, since it uses as much as digits as its factorization.
131123121132101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92172644.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 131123121132101 its reverse (101231121321131), we get a palindrome (232354242453232).
The spelling of 131123121132101 in words is "one hundred thirty-one trillion, one hundred twenty-three billion, one hundred twenty-one million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •