Base | Representation |
---|---|
bin | 11101100101100011011100… |
… | …111100110110101111111011 |
3 | 122001201201212210220001111221 |
4 | 131211203130330312233323 |
5 | 114023423011222440102 |
6 | 1140430053522532511 |
7 | 36260102630411116 |
oct | 3545433474665773 |
9 | 561651783801457 |
10 | 130124036140027 |
11 | 38509326090066 |
12 | 12716ab0507137 |
13 | 577b84aa05897 |
14 | 241c07358557d |
15 | 1009c58a62637 |
hex | 7658dcf36bfb |
130124036140027 has 2 divisors, whose sum is σ = 130124036140028. Its totient is φ = 130124036140026.
The previous prime is 130124036139989. The next prime is 130124036140057. The reversal of 130124036140027 is 720041630421031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130124036140027 - 27 = 130124036139899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130124036139974 and 130124036140001.
It is not a weakly prime, because it can be changed into another prime (130124036140057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65062018070013 + 65062018070014.
It is an arithmetic number, because the mean of its divisors is an integer number (65062018070014).
Almost surely, 2130124036140027 is an apocalyptic number.
130124036140027 is a deficient number, since it is larger than the sum of its proper divisors (1).
130124036140027 is an equidigital number, since it uses as much as digits as its factorization.
130124036140027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 34.
Adding to 130124036140027 its reverse (720041630421031), we get a palindrome (850165666561058).
The spelling of 130124036140027 in words is "one hundred thirty trillion, one hundred twenty-four billion, thirty-six million, one hundred forty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •