Base | Representation |
---|---|
bin | 11101110100010001010001… |
… | …110001010000110110001001 |
3 | 122012022102011110101002212100 |
4 | 131310101101301100312021 |
5 | 114142010110204200100 |
6 | 1142522421543104013 |
7 | 36423133212023325 |
oct | 3564212161206611 |
9 | 565272143332770 |
10 | 131135313350025 |
11 | 388691a0771816 |
12 | 1285aa9b142009 |
13 | 582301247753a |
14 | 2454da961c985 |
15 | 10261e5374400 |
hex | 774451c50d89 |
131135313350025 has 36 divisors (see below), whose sum is σ = 236433399754240. Its totient is φ = 69475662684000.
The previous prime is 131135313350023. The next prime is 131135313350051. The reversal of 131135313350025 is 520053313531131.
131135313350025 is a `hidden beast` number, since 1 + 3 + 1 + 13 + 5 + 3 + 133 + 500 + 2 + 5 = 666.
It is not a de Polignac number, because 131135313350025 - 21 = 131135313350023 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131135313350023) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1929845545 + ... + 1929913494.
Almost surely, 2131135313350025 is an apocalyptic number.
131135313350025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131135313350025 is a deficient number, since it is larger than the sum of its proper divisors (105298086404215).
131135313350025 is a wasteful number, since it uses less digits than its factorization.
131135313350025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3859759206 (or 3859759198 counting only the distinct ones).
The product of its (nonzero) digits is 60750, while the sum is 36.
Adding to 131135313350025 its reverse (520053313531131), we get a palindrome (651188626881156).
The spelling of 131135313350025 in words is "one hundred thirty-one trillion, one hundred thirty-five billion, three hundred thirteen million, three hundred fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •