Base | Representation |
---|---|
bin | 111101001111001001… |
… | …0110110111000010101 |
3 | 110120102210102002120011 |
4 | 1322132102312320111 |
5 | 4123310204344024 |
6 | 140225031240221 |
7 | 12333545015500 |
oct | 1723622667025 |
9 | 416383362504 |
10 | 131504762389 |
11 | 50853012410 |
12 | 215a0819071 |
13 | c529873690 |
14 | 651728c137 |
15 | 3649eee094 |
hex | 1e9e4b6e15 |
131504762389 has 96 divisors (see below), whose sum is σ = 185272157952. Its totient is φ = 91695744000.
The previous prime is 131504762351. The next prime is 131504762401. The reversal of 131504762389 is 983267405131.
It is not a de Polignac number, because 131504762389 - 27 = 131504762261 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131504702389) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 47975559 + ... + 47978299.
It is an arithmetic number, because the mean of its divisors is an integer number (1929918312).
It is a 1-persistent number, because it is pandigital, but 2⋅131504762389 = 263009524778 is not.
Almost surely, 2131504762389 is an apocalyptic number.
It is an amenable number.
131504762389 is a deficient number, since it is larger than the sum of its proper divisors (53767395563).
131504762389 is a wasteful number, since it uses less digits than its factorization.
131504762389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2987 (or 2980 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 49.
The spelling of 131504762389 in words is "one hundred thirty-one billion, five hundred four million, seven hundred sixty-two thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •