Base | Representation |
---|---|
bin | 11101101000101100101110… |
… | …000000011100011101010011 |
3 | 122002111101200202201010212101 |
4 | 131220230232000130131103 |
5 | 114040443103431301321 |
6 | 1141113234040541231 |
7 | 36311523166332604 |
oct | 3550545600343523 |
9 | 562441622633771 |
10 | 130340144400211 |
11 | 38591a4360a589 |
12 | 12750962781817 |
13 | 579603b354455 |
14 | 24286d4b39dab |
15 | 10106a6264791 |
hex | 768b2e01c753 |
130340144400211 has 2 divisors, whose sum is σ = 130340144400212. Its totient is φ = 130340144400210.
The previous prime is 130340144400157. The next prime is 130340144400251. The reversal of 130340144400211 is 112004441043031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130340144400211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130340144400211.
It is not a weakly prime, because it can be changed into another prime (130340144400251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65170072200105 + 65170072200106.
It is an arithmetic number, because the mean of its divisors is an integer number (65170072200106).
Almost surely, 2130340144400211 is an apocalyptic number.
130340144400211 is a deficient number, since it is larger than the sum of its proper divisors (1).
130340144400211 is an equidigital number, since it uses as much as digits as its factorization.
130340144400211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 130340144400211 its reverse (112004441043031), we get a palindrome (242344585443242).
The spelling of 130340144400211 in words is "one hundred thirty trillion, three hundred forty billion, one hundred forty-four million, four hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •