Base | Representation |
---|---|
bin | 11101111001011001110111… |
… | …100101110111011110010101 |
3 | 122020120010212012221220020210 |
4 | 131321121313211313132111 |
5 | 114213300200103334442 |
6 | 1143352452044120033 |
7 | 36460463365264221 |
oct | 3571316745673625 |
9 | 566503765856223 |
10 | 131488135214997 |
11 | 38994894492a80 |
12 | 128b7346536019 |
13 | 584a37c85a342 |
14 | 24680b9b67781 |
15 | 1030494ed119c |
hex | 779677977795 |
131488135214997 has 16 divisors (see below), whose sum is σ = 191307034820160. Its totient is φ = 79668293328000.
The previous prime is 131488135214951. The next prime is 131488135214999. The reversal of 131488135214997 is 799412531884131.
It is not a de Polignac number, because 131488135214997 - 28 = 131488135214741 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131488135214999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537015504 + ... + 537260297.
It is an arithmetic number, because the mean of its divisors is an integer number (11956689676260).
Almost surely, 2131488135214997 is an apocalyptic number.
It is an amenable number.
131488135214997 is a deficient number, since it is larger than the sum of its proper divisors (59818899605163).
131488135214997 is a wasteful number, since it uses less digits than its factorization.
131488135214997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074279524.
The product of its digits is 52254720, while the sum is 66.
It can be divided in two parts, 1314881 and 35214997, that added together give a triangular number (36529878 = T8547).
The spelling of 131488135214997 in words is "one hundred thirty-one trillion, four hundred eighty-eight billion, one hundred thirty-five million, two hundred fourteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •