Base | Representation |
---|---|
bin | 111101000100111001… |
… | …0110001011010010101 |
3 | 110112112211012100112221 |
4 | 1322021302301122111 |
5 | 4122104131311221 |
6 | 140130543142341 |
7 | 12322200315334 |
oct | 1721162613225 |
9 | 415484170487 |
10 | 131160807061 |
11 | 50696946709 |
12 | 215055a49b1 |
13 | c4a352590b |
14 | 64c3715d1b |
15 | 3629c0b541 |
hex | 1e89cb1695 |
131160807061 has 4 divisors (see below), whose sum is σ = 134211058432. Its totient is φ = 128110555692.
The previous prime is 131160807053. The next prime is 131160807097. The reversal of 131160807061 is 160708061131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131160807061 - 23 = 131160807053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131160807161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1525125621 + ... + 1525125706.
It is an arithmetic number, because the mean of its divisors is an integer number (33552764608).
Almost surely, 2131160807061 is an apocalyptic number.
It is an amenable number.
131160807061 is a deficient number, since it is larger than the sum of its proper divisors (3050251371).
131160807061 is an equidigital number, since it uses as much as digits as its factorization.
131160807061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3050251370.
The product of its (nonzero) digits is 6048, while the sum is 34.
Adding to 131160807061 its reverse (160708061131), we get a palindrome (291868868192).
The spelling of 131160807061 in words is "one hundred thirty-one billion, one hundred sixty million, eight hundred seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •