Base | Representation |
---|---|
bin | 111101010111110101… |
… | …1011110000110011001 |
3 | 110121012010020012102010 |
4 | 1322233223132012121 |
5 | 4124404341132121 |
6 | 140314010500133 |
7 | 12344016101220 |
oct | 1725753360631 |
9 | 417163205363 |
10 | 131796427161 |
11 | 50992713483 |
12 | 21662434649 |
13 | c575113599 |
14 | 6543cd1cb7 |
15 | 3665913376 |
hex | 1eafade199 |
131796427161 has 32 divisors (see below), whose sum is σ = 203074600960. Its totient is φ = 74475386496.
The previous prime is 131796427129. The next prime is 131796427183. The reversal of 131796427161 is 161724697131.
It is not a de Polignac number, because 131796427161 - 25 = 131796427129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131796427161.
It is not an unprimeable number, because it can be changed into a prime (131796427261) 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 31 ways as a sum of consecutive naturals, for example, 738285 + ... + 899253.
It is an arithmetic number, because the mean of its divisors is an integer number (6346081280).
Almost surely, 2131796427161 is an apocalyptic number.
It is an amenable number.
131796427161 is a deficient number, since it is larger than the sum of its proper divisors (71278173799).
131796427161 is a wasteful number, since it uses less digits than its factorization.
131796427161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161413.
The product of its digits is 381024, while the sum is 48.
The spelling of 131796427161 in words is "one hundred thirty-one billion, seven hundred ninety-six million, four hundred twenty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •