Base | Representation |
---|---|
bin | 11101111101001101110001… |
… | …001111010011101101100011 |
3 | 122021111011211112110212101012 |
4 | 131331031301033103231203 |
5 | 114232043021020034412 |
6 | 1144113042511131135 |
7 | 36515424233221310 |
oct | 3575156117235543 |
9 | 567434745425335 |
10 | 131750021643107 |
11 | 38a8596355762a |
12 | 1293a053813aab |
13 | 5868c8739793a |
14 | 2476a41071d07 |
15 | 10371c15d4c22 |
hex | 77d3713d3b63 |
131750021643107 has 16 divisors (see below), whose sum is σ = 154418609759232. Its totient is φ = 110049461282880.
The previous prime is 131750021643089. The next prime is 131750021643131. The reversal of 131750021643107 is 701346120057131.
It is not a de Polignac number, because 131750021643107 - 216 = 131750021577571 is a prime.
It is a super-2 number, since 2×1317500216431072 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is not an unprimeable number, because it can be changed into a prime (131750021643187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 259689563 + ... + 260196404.
It is an arithmetic number, because the mean of its divisors is an integer number (9651163109952).
Almost surely, 2131750021643107 is an apocalyptic number.
131750021643107 is a deficient number, since it is larger than the sum of its proper divisors (22668588116125).
131750021643107 is an equidigital number, since it uses as much as digits as its factorization.
131750021643107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519886898.
The product of its (nonzero) digits is 105840, while the sum is 41.
The spelling of 131750021643107 in words is "one hundred thirty-one trillion, seven hundred fifty billion, twenty-one million, six hundred forty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •