Base | Representation |
---|---|
bin | 111100101110100011… |
… | …1000001100110100101 |
3 | 110110121120120101210022 |
4 | 1321131013001212211 |
5 | 4114040223012131 |
6 | 135524323204525 |
7 | 12264465261512 |
oct | 1713507014645 |
9 | 413546511708 |
10 | 130411141541 |
11 | 5034176492a |
12 | 21336516745 |
13 | c3b4117455 |
14 | 6451d30309 |
15 | 35d3ec837b |
hex | 1e5d1c19a5 |
130411141541 has 2 divisors, whose sum is σ = 130411141542. Its totient is φ = 130411141540.
The previous prime is 130411141499. The next prime is 130411141561. The reversal of 130411141541 is 145141114031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100534019041 + 29877122500 = 317071^2 + 172850^2 .
It is a cyclic number.
It is not a de Polignac number, because 130411141541 - 214 = 130411125157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130411141541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130411141561) 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, 65205570770 + 65205570771.
It is an arithmetic number, because the mean of its divisors is an integer number (65205570771).
Almost surely, 2130411141541 is an apocalyptic number.
It is an amenable number.
130411141541 is a deficient number, since it is larger than the sum of its proper divisors (1).
130411141541 is an equidigital number, since it uses as much as digits as its factorization.
130411141541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 130411141541 its reverse (145141114031), we get a palindrome (275552255572).
The spelling of 130411141541 in words is "one hundred thirty billion, four hundred eleven million, one hundred forty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •