Base | Representation |
---|---|
bin | 11101101110010011101010… |
… | …011001101001010111000001 |
3 | 122010212020111211220121022201 |
4 | 131232103222121221113001 |
5 | 114113301420121300414 |
6 | 1142010254131033201 |
7 | 36351416113231102 |
oct | 3556235231512701 |
9 | 563766454817281 |
10 | 130725557212609 |
11 | 38720441046a37 |
12 | 127b35a473b801 |
13 | 57c34a0822a28 |
14 | 243d2178563a9 |
15 | 101a7121dd574 |
hex | 76e4ea6695c1 |
130725557212609 has 2 divisors, whose sum is σ = 130725557212610. Its totient is φ = 130725557212608.
The previous prime is 130725557212517. The next prime is 130725557212631. The reversal of 130725557212609 is 906212755527031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80688396259584 + 50037160953025 = 8982672^2 + 7073695^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130725557212609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130725557212609.
It is not a weakly prime, because it can be changed into another prime (130725557212409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65362778606304 + 65362778606305.
It is an arithmetic number, because the mean of its divisors is an integer number (65362778606305).
Almost surely, 2130725557212609 is an apocalyptic number.
It is an amenable number.
130725557212609 is a deficient number, since it is larger than the sum of its proper divisors (1).
130725557212609 is an equidigital number, since it uses as much as digits as its factorization.
130725557212609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7938000, while the sum is 55.
The spelling of 130725557212609 in words is "one hundred thirty trillion, seven hundred twenty-five billion, five hundred fifty-seven million, two hundred twelve thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •