Base | Representation |
---|---|
bin | 11101101010001010101011… |
… | …010010000010111100111101 |
3 | 122002212001002200112122201211 |
4 | 131222022223102002330331 |
5 | 114044121212241223031 |
6 | 1141231440534204421 |
7 | 36322024222316236 |
oct | 3552125322027475 |
9 | 562761080478654 |
10 | 130441030414141 |
11 | 38620804094aa7 |
12 | 127684191b3711 |
13 | 57a26c85a1595 |
14 | 242d54571608d |
15 | 101310d166bb1 |
hex | 76a2ab482f3d |
130441030414141 has 2 divisors, whose sum is σ = 130441030414142. Its totient is φ = 130441030414140.
The previous prime is 130441030414129. The next prime is 130441030414151. The reversal of 130441030414141 is 141414030144031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122621294902500 + 7819735511641 = 11073450^2 + 2796379^2 .
It is a cyclic number.
It is not a de Polignac number, because 130441030414141 - 211 = 130441030412093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130441030414151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65220515207070 + 65220515207071.
It is an arithmetic number, because the mean of its divisors is an integer number (65220515207071).
Almost surely, 2130441030414141 is an apocalyptic number.
It is an amenable number.
130441030414141 is a deficient number, since it is larger than the sum of its proper divisors (1).
130441030414141 is an equidigital number, since it uses as much as digits as its factorization.
130441030414141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 130441030414141 its reverse (141414030144031), we get a palindrome (271855060558172).
The spelling of 130441030414141 in words is "one hundred thirty trillion, four hundred forty-one billion, thirty million, four hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •