Base | Representation |
---|---|
bin | 111101000000101110… |
… | …1011111110100011001 |
3 | 110112012002011001010022 |
4 | 1322001131133310121 |
5 | 4121312334342444 |
6 | 140105031000225 |
7 | 12315552141311 |
oct | 1720135376431 |
9 | 415162131108 |
10 | 131021012249 |
11 | 50624a44806 |
12 | 21486809075 |
13 | c48058aaaa |
14 | 64acd26441 |
15 | 361c7e59ee |
hex | 1e8175fd19 |
131021012249 has 2 divisors, whose sum is σ = 131021012250. Its totient is φ = 131021012248.
The previous prime is 131021012219. The next prime is 131021012281. The reversal of 131021012249 is 942210120131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102403200025 + 28617812224 = 320005^2 + 169168^2 .
It is a cyclic number.
It is not a de Polignac number, because 131021012249 - 220 = 131019963673 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (131021012219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65510506124 + 65510506125.
It is an arithmetic number, because the mean of its divisors is an integer number (65510506125).
Almost surely, 2131021012249 is an apocalyptic number.
It is an amenable number.
131021012249 is a deficient number, since it is larger than the sum of its proper divisors (1).
131021012249 is an equidigital number, since it uses as much as digits as its factorization.
131021012249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 131021012249 in words is "one hundred thirty-one billion, twenty-one million, twelve thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •