Base | Representation |
---|---|
bin | 111100100101111100… |
… | …0100101111000100001 |
3 | 110102212102202212111022 |
4 | 1321023320211320201 |
5 | 4112442232122223 |
6 | 135435521055225 |
7 | 12254355662066 |
oct | 1711370457041 |
9 | 412772685438 |
10 | 130122145313 |
11 | 50203616776 |
12 | 21275787515 |
13 | c3692a0074 |
14 | 64257c2c6d |
15 | 35b893eac8 |
hex | 1e4be25e21 |
130122145313 has 2 divisors, whose sum is σ = 130122145314. Its totient is φ = 130122145312.
The previous prime is 130122145253. The next prime is 130122145327. The reversal of 130122145313 is 313541221031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79646435089 + 50475710224 = 282217^2 + 224668^2 .
It is an emirp because it is prime and its reverse (313541221031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130122145313 - 28 = 130122145057 is a prime.
It is not a weakly prime, because it can be changed into another prime (130122145393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65061072656 + 65061072657.
It is an arithmetic number, because the mean of its divisors is an integer number (65061072657).
Almost surely, 2130122145313 is an apocalyptic number.
It is an amenable number.
130122145313 is a deficient number, since it is larger than the sum of its proper divisors (1).
130122145313 is an equidigital number, since it uses as much as digits as its factorization.
130122145313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 130122145313 its reverse (313541221031), we get a palindrome (443663366344).
The spelling of 130122145313 in words is "one hundred thirty billion, one hundred twenty-two million, one hundred forty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •