Base | Representation |
---|---|
bin | 11101101011011010010011… |
… | …001011010000100100001101 |
3 | 122010011012202222022020222011 |
4 | 131223122103023100210031 |
5 | 114102021310440441004 |
6 | 1141335020303021221 |
7 | 36331141656145624 |
oct | 3553322313204415 |
9 | 563135688266864 |
10 | 130526525327629 |
11 | 38653a968009a2 |
12 | 12780ab929a811 |
13 | 57aa7a1c58aa2 |
14 | 24337361826bb |
15 | 1015463c4d004 |
hex | 76b6932d090d |
130526525327629 has 2 divisors, whose sum is σ = 130526525327630. Its totient is φ = 130526525327628.
The previous prime is 130526525327581. The next prime is 130526525327641. The reversal of 130526525327629 is 926723525625031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104085435759529 + 26441089568100 = 10202227^2 + 5142090^2 .
It is a cyclic number.
It is not a de Polignac number, because 130526525327629 - 245 = 95342153238797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130526525327929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65263262663814 + 65263262663815.
It is an arithmetic number, because the mean of its divisors is an integer number (65263262663815).
Almost surely, 2130526525327629 is an apocalyptic number.
It is an amenable number.
130526525327629 is a deficient number, since it is larger than the sum of its proper divisors (1).
130526525327629 is an equidigital number, since it uses as much as digits as its factorization.
130526525327629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824000, while the sum is 58.
The spelling of 130526525327629 in words is "one hundred thirty trillion, five hundred twenty-six billion, five hundred twenty-five million, three hundred twenty-seven thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •