Base | Representation |
---|---|
bin | 111100100111000101… |
… | …1000100110111101101 |
3 | 110102222010000210022121 |
4 | 1321032023010313231 |
5 | 4113032044422021 |
6 | 135443412112541 |
7 | 12255333244225 |
oct | 1711613046755 |
9 | 412863023277 |
10 | 130160545261 |
11 | 5022326416a |
12 | 21286605751 |
13 | c374226526 |
14 | 642a93b085 |
15 | 35bbec7741 |
hex | 1e4e2c4ded |
130160545261 has 2 divisors, whose sum is σ = 130160545262. Its totient is φ = 130160545260.
The previous prime is 130160545199. The next prime is 130160545267. The reversal of 130160545261 is 162545061031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129505697161 + 654848100 = 359869^2 + 25590^2 .
It is a cyclic number.
It is not a de Polignac number, because 130160545261 - 211 = 130160543213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130160545267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65080272630 + 65080272631.
It is an arithmetic number, because the mean of its divisors is an integer number (65080272631).
Almost surely, 2130160545261 is an apocalyptic number.
It is an amenable number.
130160545261 is a deficient number, since it is larger than the sum of its proper divisors (1).
130160545261 is an equidigital number, since it uses as much as digits as its factorization.
130160545261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 130160545261 in words is "one hundred thirty billion, one hundred sixty million, five hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •