Base | Representation |
---|---|
bin | 1011000010001000101010… |
… | …0110100111000011000111 |
3 | 1120221202001001200201210101 |
4 | 2300202022212213003013 |
5 | 3042224412113134002 |
6 | 41445014231504531 |
7 | 2361313150201546 |
oct | 260421246470307 |
9 | 46852031621711 |
10 | 12131313021127 |
11 | 3957951a35163 |
12 | 143b168228147 |
13 | 69cc9360b0a1 |
14 | 2dd2315d815d |
15 | 16086b197587 |
hex | b088a9a70c7 |
12131313021127 has 2 divisors, whose sum is σ = 12131313021128. Its totient is φ = 12131313021126.
The previous prime is 12131313021001. The next prime is 12131313021197. The reversal of 12131313021127 is 72112031313121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12131313021127 - 243 = 3335219998919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12131313021095 and 12131313021104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12131313021197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6065656510563 + 6065656510564.
It is an arithmetic number, because the mean of its divisors is an integer number (6065656510564).
Almost surely, 212131313021127 is an apocalyptic number.
12131313021127 is a deficient number, since it is larger than the sum of its proper divisors (1).
12131313021127 is an equidigital number, since it uses as much as digits as its factorization.
12131313021127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
Adding to 12131313021127 its reverse (72112031313121), we get a palindrome (84243344334248).
The spelling of 12131313021127 in words is "twelve trillion, one hundred thirty-one billion, three hundred thirteen million, twenty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •