Base | Representation |
---|---|
bin | 11101101011010011000001… |
… | …001100000111100100101001 |
3 | 122010010110121010102212122022 |
4 | 131223103001030013210221 |
5 | 114101404303041322111 |
6 | 1141331244425034225 |
7 | 36330444145462226 |
oct | 3553230114074451 |
9 | 563113533385568 |
10 | 130518707370281 |
11 | 3865074477091a |
12 | 1277b497025975 |
13 | 57a9b27353519 |
14 | 24331d3b4494d |
15 | 10151577112db |
hex | 76b4c1307929 |
130518707370281 has 2 divisors, whose sum is σ = 130518707370282. Its totient is φ = 130518707370280.
The previous prime is 130518707370169. The next prime is 130518707370287. The reversal of 130518707370281 is 182073707815031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128882866370281 + 1635841000000 = 11352659^2 + 1279000^2 .
It is a cyclic number.
It is not a de Polignac number, because 130518707370281 - 214 = 130518707353897 is a prime.
It is a super-2 number, since 2×1305187073702812 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (130518707370287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65259353685140 + 65259353685141.
It is an arithmetic number, because the mean of its divisors is an integer number (65259353685141).
Almost surely, 2130518707370281 is an apocalyptic number.
It is an amenable number.
130518707370281 is a deficient number, since it is larger than the sum of its proper divisors (1).
130518707370281 is an equidigital number, since it uses as much as digits as its factorization.
130518707370281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1975680, while the sum is 53.
The spelling of 130518707370281 in words is "one hundred thirty trillion, five hundred eighteen billion, seven hundred seven million, three hundred seventy thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •