Base | Representation |
---|---|
bin | 1011000010000111111110… |
… | …1101100101101000110001 |
3 | 1120221201120022212120212102 |
4 | 2300201333231211220301 |
5 | 3042224023324112402 |
6 | 41444544143310145 |
7 | 2361305501124002 |
oct | 260417755455061 |
9 | 46851508776772 |
10 | 12131130300977 |
11 | 3957868884876 |
12 | 143b116bab355 |
13 | 69cc647c405c |
14 | 2dd2152331a9 |
15 | 16085a103102 |
hex | b087fb65a31 |
12131130300977 has 2 divisors, whose sum is σ = 12131130300978. Its totient is φ = 12131130300976.
The previous prime is 12131130300923. The next prime is 12131130301007. The reversal of 12131130300977 is 77900303113121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11314639148176 + 816491152801 = 3363724^2 + 903599^2 .
It is a cyclic number.
It is not a de Polignac number, because 12131130300977 - 238 = 11856252394033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12131130300977.
It is not a weakly prime, because it can be changed into another prime (12131130300077) 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, 6065565150488 + 6065565150489.
It is an arithmetic number, because the mean of its divisors is an integer number (6065565150489).
Almost surely, 212131130300977 is an apocalyptic number.
It is an amenable number.
12131130300977 is a deficient number, since it is larger than the sum of its proper divisors (1).
12131130300977 is an equidigital number, since it uses as much as digits as its factorization.
12131130300977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23814, while the sum is 38.
The spelling of 12131130300977 in words is "twelve trillion, one hundred thirty-one billion, one hundred thirty million, three hundred thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •