Base | Representation |
---|---|
bin | 11101110101110100101010… |
… | …110000100000110010001101 |
3 | 122012200121121221021021002011 |
4 | 131311310222300200302031 |
5 | 114200232140423233031 |
6 | 1143043431352101221 |
7 | 36433631632212424 |
oct | 3565645260406215 |
9 | 565617557237064 |
10 | 131242033024141 |
11 | 388aa4851954a6 |
12 | 12877703394811 |
13 | 58300bc1900c0 |
14 | 245a210ca82bb |
15 | 1028d8e4a36b1 |
hex | 775d2ac20c8d |
131242033024141 has 16 divisors (see below), whose sum is σ = 145053647362624. Its totient is φ = 117978006553344.
The previous prime is 131242033024121. The next prime is 131242033024153. The reversal of 131242033024141 is 141420330242131.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-131242033024141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131242033024121) 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, 348149931 + ... + 348526696.
It is an arithmetic number, because the mean of its divisors is an integer number (9065852960164).
Almost surely, 2131242033024141 is an apocalyptic number.
It is an amenable number.
131242033024141 is a deficient number, since it is larger than the sum of its proper divisors (13811614338483).
131242033024141 is a wasteful number, since it uses less digits than its factorization.
131242033024141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696677020.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 131242033024141 its reverse (141420330242131), we get a palindrome (272662363266272).
The spelling of 131242033024141 in words is "one hundred thirty-one trillion, two hundred forty-two billion, thirty-three million, twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •