Base | Representation |
---|---|
bin | 11101110011110000011001… |
… | …000111110110000101000111 |
3 | 122012012001000122011011021001 |
4 | 131303300121013312011013 |
5 | 114140420301311330043 |
6 | 1142454302100434131 |
7 | 36420443202661132 |
oct | 3563603107660507 |
9 | 565161018134231 |
10 | 131100003230023 |
11 | 38855221064a63 |
12 | 128540859a8947 |
13 | 581c8a5c216c9 |
14 | 24533b9c67219 |
15 | 102532a48674d |
hex | 773c191f6147 |
131100003230023 has 2 divisors, whose sum is σ = 131100003230024. Its totient is φ = 131100003230022.
The previous prime is 131100003229969. The next prime is 131100003230039. The reversal of 131100003230023 is 320032300001131.
It is a strong prime.
It is an emirp because it is prime and its reverse (320032300001131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131100003230023 - 229 = 131099466359111 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131100003230923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65550001615011 + 65550001615012.
It is an arithmetic number, because the mean of its divisors is an integer number (65550001615012).
Almost surely, 2131100003230023 is an apocalyptic number.
131100003230023 is a deficient number, since it is larger than the sum of its proper divisors (1).
131100003230023 is an equidigital number, since it uses as much as digits as its factorization.
131100003230023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 131100003230023 its reverse (320032300001131), we get a palindrome (451132303231154).
The spelling of 131100003230023 in words is "one hundred thirty-one trillion, one hundred billion, three million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •