Base | Representation |
---|---|
bin | 111100111100000110… |
… | …1001110010001100011 |
3 | 110111210020222221220211 |
4 | 1321320031032101203 |
5 | 4121003113014024 |
6 | 140041403114551 |
7 | 12311655350104 |
oct | 1717015162143 |
9 | 414706887824 |
10 | 130865751139 |
11 | 50555339842 |
12 | 21442812a57 |
13 | c457369306 |
14 | 649646c3ab |
15 | 360dd77594 |
hex | 1e7834e463 |
130865751139 has 2 divisors, whose sum is σ = 130865751140. Its totient is φ = 130865751138.
The previous prime is 130865751097. The next prime is 130865751169. The reversal of 130865751139 is 931157568031.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130865751139 - 27 = 130865751011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130865751092 and 130865751101.
It is not a weakly prime, because it can be changed into another prime (130865751169) 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 as a sum of consecutive naturals, namely, 65432875569 + 65432875570.
It is an arithmetic number, because the mean of its divisors is an integer number (65432875570).
Almost surely, 2130865751139 is an apocalyptic number.
130865751139 is a deficient number, since it is larger than the sum of its proper divisors (1).
130865751139 is an equidigital number, since it uses as much as digits as its factorization.
130865751139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 49.
The spelling of 130865751139 in words is "one hundred thirty billion, eight hundred sixty-five million, seven hundred fifty-one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •