Base | Representation |
---|---|
bin | 11101101011101001111101… |
… | …100110111001110110000011 |
3 | 122010012211012001101001200102 |
4 | 131223221331212321312003 |
5 | 114102310231344020102 |
6 | 1141350441203313015 |
7 | 36332305513013414 |
oct | 3553517546716603 |
9 | 563184161331612 |
10 | 130543343345027 |
11 | 38660137073328 |
12 | 1278421167b76b |
13 | 57ac252332a82 |
14 | 243448da0d80b |
15 | 1015aea479402 |
hex | 76ba7d9b9d83 |
130543343345027 has 2 divisors, whose sum is σ = 130543343345028. Its totient is φ = 130543343345026.
The previous prime is 130543343345021. The next prime is 130543343345033. The reversal of 130543343345027 is 720543343345031.
It is a balanced prime because it is at equal distance from previous prime (130543343345021) and next prime (130543343345033).
It is a cyclic number.
It is not a de Polignac number, because 130543343345027 - 210 = 130543343344003 is a prime.
It is not a weakly prime, because it can be changed into another prime (130543343345021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65271671672513 + 65271671672514.
It is an arithmetic number, because the mean of its divisors is an integer number (65271671672514).
Almost surely, 2130543343345027 is an apocalyptic number.
130543343345027 is a deficient number, since it is larger than the sum of its proper divisors (1).
130543343345027 is an equidigital number, since it uses as much as digits as its factorization.
130543343345027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5443200, while the sum is 47.
It can be divided in two parts, 13054334 and 3345027, that added together give a palindrome (16399361).
The spelling of 130543343345027 in words is "one hundred thirty trillion, five hundred forty-three billion, three hundred forty-three million, three hundred forty-five thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •