Base | Representation |
---|---|
bin | 11101111000011101100111… |
… | …100101101001100011101111 |
3 | 122020022221212122122220011121 |
4 | 131320131213211221203233 |
5 | 114211220202201304403 |
6 | 1143303032412401411 |
7 | 36453013261656235 |
oct | 3570354745514357 |
9 | 566287778586147 |
10 | 131423442213103 |
11 | 3896a406a22157 |
12 | 128a68b0a76267 |
13 | 584423ca4c771 |
14 | 2464cddcc8955 |
15 | 102d95a7693bd |
hex | 7787679698ef |
131423442213103 has 2 divisors, whose sum is σ = 131423442213104. Its totient is φ = 131423442213102.
The previous prime is 131423442213101. The next prime is 131423442213241. The reversal of 131423442213103 is 301312244324131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131423442213103 - 21 = 131423442213101 is a prime.
Together with 131423442213101, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131423442213101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65711721106551 + 65711721106552.
It is an arithmetic number, because the mean of its divisors is an integer number (65711721106552).
Almost surely, 2131423442213103 is an apocalyptic number.
131423442213103 is a deficient number, since it is larger than the sum of its proper divisors (1).
131423442213103 is an equidigital number, since it uses as much as digits as its factorization.
131423442213103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 131423442213103 its reverse (301312244324131), we get a palindrome (432735686537234).
The spelling of 131423442213103 in words is "one hundred thirty-one trillion, four hundred twenty-three billion, four hundred forty-two million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •