Base | Representation |
---|---|
bin | 11101110110101100100001… |
… | …101110110011011101000011 |
3 | 122012220100102220122101211101 |
4 | 131312230201232303131003 |
5 | 114202223004321423043 |
6 | 1143131151114555231 |
7 | 36441154144514062 |
oct | 3566544156633503 |
9 | 565810386571741 |
10 | 131302011123523 |
11 | 38922963274279 |
12 | 12887261a38b17 |
13 | 583595a21ca36 |
14 | 245d0a089a1d9 |
15 | 102a6eed2c24d |
hex | 776b21bb3743 |
131302011123523 has 2 divisors, whose sum is σ = 131302011123524. Its totient is φ = 131302011123522.
The previous prime is 131302011123509. The next prime is 131302011123539. The reversal of 131302011123523 is 325321110203131.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131302011123523 is a prime.
It is a super-3 number, since 3×1313020111235233 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131302011123491 and 131302011123500.
It is not a weakly prime, because it can be changed into another prime (131302011123583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65651005561761 + 65651005561762.
It is an arithmetic number, because the mean of its divisors is an integer number (65651005561762).
Almost surely, 2131302011123523 is an apocalyptic number.
131302011123523 is a deficient number, since it is larger than the sum of its proper divisors (1).
131302011123523 is an equidigital number, since it uses as much as digits as its factorization.
131302011123523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 131302011123523 its reverse (325321110203131), we get a palindrome (456623121326654).
The spelling of 131302011123523 in words is "one hundred thirty-one trillion, three hundred two billion, eleven million, one hundred twenty-three thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •