Base | Representation |
---|---|
bin | 11101101010001100100010… |
… | …100001101110101101000011 |
3 | 122002212020021010000200002201 |
4 | 131222030202201232231003 |
5 | 114044134311414423321 |
6 | 1141232411242054031 |
7 | 36322124624200426 |
oct | 3552144241565503 |
9 | 562766233020081 |
10 | 130443031014211 |
11 | 38621640401493 |
12 | 127688971aa317 |
13 | 57a2956bc8ac6 |
14 | 242d6952c99bd |
15 | 10131c8ae7291 |
hex | 76a32286eb43 |
130443031014211 has 2 divisors, whose sum is σ = 130443031014212. Its totient is φ = 130443031014210.
The previous prime is 130443031014161. The next prime is 130443031014253. The reversal of 130443031014211 is 112410130344031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130443031014211 - 219 = 130443030489923 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130443031014211.
It is not a weakly prime, because it can be changed into another prime (130443001014211) 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, 65221515507105 + 65221515507106.
It is an arithmetic number, because the mean of its divisors is an integer number (65221515507106).
Almost surely, 2130443031014211 is an apocalyptic number.
130443031014211 is a deficient number, since it is larger than the sum of its proper divisors (1).
130443031014211 is an equidigital number, since it uses as much as digits as its factorization.
130443031014211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 130443031014211 its reverse (112410130344031), we get a palindrome (242853161358242).
The spelling of 130443031014211 in words is "one hundred thirty trillion, four hundred forty-three billion, thirty-one million, fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.861 sec. • engine limits •