Base | Representation |
---|---|
bin | 11101101110110001001111… |
… | …110001010001100111100101 |
3 | 122010222021111122020101011002 |
4 | 131232301033301101213211 |
5 | 114114311444101123314 |
6 | 1142033030151123045 |
7 | 36353622231224441 |
oct | 3556611761214745 |
9 | 563867448211132 |
10 | 130757322676709 |
11 | 387329618a6303 |
12 | 127b978a973485 |
13 | 57c64938a5431 |
14 | 244098c547821 |
15 | 101b470cecade |
hex | 76ec4fc519e5 |
130757322676709 has 16 divisors (see below), whose sum is σ = 138492321848496. Its totient is φ = 123027150643200.
The previous prime is 130757322676679. The next prime is 130757322676751. The reversal of 130757322676709 is 907676223757031.
It can be written as a sum of positive squares in 8 ways, for example, as 37246914150625 + 93510408526084 = 6103025^2 + 9670078^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130757322676709 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130757322673709) 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, 780850739 + ... + 781018175.
It is an arithmetic number, because the mean of its divisors is an integer number (8655770115531).
Almost surely, 2130757322676709 is an apocalyptic number.
It is an amenable number.
130757322676709 is a deficient number, since it is larger than the sum of its proper divisors (7734999171787).
130757322676709 is a wasteful number, since it uses less digits than its factorization.
130757322676709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181576.
The product of its (nonzero) digits is 140026320, while the sum is 65.
The spelling of 130757322676709 in words is "one hundred thirty trillion, seven hundred fifty-seven billion, three hundred twenty-two million, six hundred seventy-six thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •