Base | Representation |
---|---|
bin | 111101001011010011… |
… | …1011001111001010001 |
3 | 110120002210222210001210 |
4 | 1322112213121321101 |
5 | 4123024214242321 |
6 | 140204150050333 |
7 | 12330421662612 |
oct | 1722647317121 |
9 | 416083883053 |
10 | 131375930961 |
11 | 50797319460 |
12 | 215656499a9 |
13 | c508c76a72 |
14 | 6504113c09 |
15 | 363da51b76 |
hex | 1e969d9e51 |
131375930961 has 16 divisors (see below), whose sum is σ = 191100800448. Its totient is φ = 79618219200.
The previous prime is 131375930957. The next prime is 131375931019. The reversal of 131375930961 is 169039573131.
It is a happy number.
It is not a de Polignac number, because 131375930961 - 22 = 131375930957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131375930961.
It is not an unprimeable number, because it can be changed into a prime (131375930921) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 790815 + ... + 942411.
It is an arithmetic number, because the mean of its divisors is an integer number (11943800028).
Almost surely, 2131375930961 is an apocalyptic number.
131375930961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131375930961 is a deficient number, since it is larger than the sum of its proper divisors (59724869487).
131375930961 is a wasteful number, since it uses less digits than its factorization.
131375930961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177872.
The product of its (nonzero) digits is 459270, while the sum is 48.
The spelling of 131375930961 in words is "one hundred thirty-one billion, three hundred seventy-five million, nine hundred thirty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •