Base | Representation |
---|---|
bin | 111101001111001110… |
… | …1111011101010100010 |
3 | 110120102222212120222101 |
4 | 1322132131323222202 |
5 | 4123311430244240 |
6 | 140225213401014 |
7 | 12333611466541 |
oct | 1723635735242 |
9 | 416388776871 |
10 | 131507665570 |
11 | 50854715636 |
12 | 215a179916a |
13 | c52a34bc38 |
14 | 6517806158 |
15 | 364a3c439a |
hex | 1e9e77baa2 |
131507665570 has 32 divisors (see below), whose sum is σ = 251055002880. Its totient is φ = 49491119040.
The previous prime is 131507665567. The next prime is 131507665579. The reversal of 131507665570 is 75566705131.
It is a super-2 number, since 2×1315076655702 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a self number, because there is not a number n which added to its sum of digits gives 131507665570.
It is not an unprimeable number, because it can be changed into a prime (131507665579) 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, 4672630 + ... + 4700689.
It is an arithmetic number, because the mean of its divisors is an integer number (7845468840).
Almost surely, 2131507665570 is an apocalyptic number.
131507665570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131507665570 is a deficient number, since it is larger than the sum of its proper divisors (119547337310).
131507665570 is a wasteful number, since it uses less digits than its factorization.
131507665570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9373410.
The product of its (nonzero) digits is 661500, while the sum is 46.
The spelling of 131507665570 in words is "one hundred thirty-one billion, five hundred seven million, six hundred sixty-five thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •