Base | Representation |
---|---|
bin | 1010011001011000010000… |
… | …1111011100011011101101 |
3 | 1111110210201212102222000001 |
4 | 2212112010033130123231 |
5 | 2444241421403201124 |
6 | 40151215335104301 |
7 | 2256604655021326 |
oct | 246260417343355 |
9 | 44423655388001 |
10 | 11431126615789 |
11 | 3707a05a69471 |
12 | 1347519212091 |
13 | 64bc4866693a |
14 | 2b73ab64d44d |
15 | 14c53aa6db44 |
hex | a65843dc6ed |
11431126615789 has 2 divisors, whose sum is σ = 11431126615790. Its totient is φ = 11431126615788.
The previous prime is 11431126615787. The next prime is 11431126615793. The reversal of 11431126615789 is 98751662113411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11368644114564 + 62482501225 = 3371742^2 + 249965^2 .
It is a cyclic number.
It is not a de Polignac number, because 11431126615789 - 21 = 11431126615787 is a prime.
Together with 11431126615787, 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 (11431126615787) 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, 5715563307894 + 5715563307895.
It is an arithmetic number, because the mean of its divisors is an integer number (5715563307895).
Almost surely, 211431126615789 is an apocalyptic number.
It is an amenable number.
11431126615789 is a deficient number, since it is larger than the sum of its proper divisors (1).
11431126615789 is an equidigital number, since it uses as much as digits as its factorization.
11431126615789 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2177280, while the sum is 55.
The spelling of 11431126615789 in words is "eleven trillion, four hundred thirty-one billion, one hundred twenty-six million, six hundred fifteen thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •