Base | Representation |
---|---|
bin | 111100101011111111… |
… | …1011000011111110001 |
3 | 110110101120221202121012 |
4 | 1321113333120133301 |
5 | 4113401231031311 |
6 | 135512014240305 |
7 | 12262403236103 |
oct | 1712777303761 |
9 | 413346852535 |
10 | 130325252081 |
11 | 502a8230902 |
12 | 213117b6095 |
13 | c39c3a449b |
14 | 6444773573 |
15 | 35cb6ae78b |
hex | 1e57fd87f1 |
130325252081 has 2 divisors, whose sum is σ = 130325252082. Its totient is φ = 130325252080.
The previous prime is 130325252039. The next prime is 130325252089. The reversal of 130325252081 is 180252523031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79614265600 + 50710986481 = 282160^2 + 225191^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130325252081 is a prime.
It is a super-2 number, since 2×1303252520812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130325252089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65162626040 + 65162626041.
It is an arithmetic number, because the mean of its divisors is an integer number (65162626041).
Almost surely, 2130325252081 is an apocalyptic number.
It is an amenable number.
130325252081 is a deficient number, since it is larger than the sum of its proper divisors (1).
130325252081 is an equidigital number, since it uses as much as digits as its factorization.
130325252081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 130325252081 in words is "one hundred thirty billion, three hundred twenty-five million, two hundred fifty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •