Base | Representation |
---|---|
bin | 11101110010100111110001… |
… | …001100101100001110101111 |
3 | 122011220120202010110212010112 |
4 | 131302213301030230032233 |
5 | 114133131101121003211 |
6 | 1142354404211130235 |
7 | 36412012616316344 |
oct | 3562476114541657 |
9 | 564816663425115 |
10 | 131022024000431 |
11 | 388251458a1673 |
12 | 12840b428a397b |
13 | 5815429656c35 |
14 | 244d6dd6327cb |
15 | 10232b45ce88b |
hex | 7729f132c3af |
131022024000431 has 2 divisors, whose sum is σ = 131022024000432. Its totient is φ = 131022024000430.
The previous prime is 131022024000359. The next prime is 131022024000467. The reversal of 131022024000431 is 134000420220131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131022024000431 - 234 = 131004844131247 is a prime.
It is a super-2 number, since 2×1310220240004312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131022024000397 and 131022024000406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131022024002431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65511012000215 + 65511012000216.
It is an arithmetic number, because the mean of its divisors is an integer number (65511012000216).
Almost surely, 2131022024000431 is an apocalyptic number.
131022024000431 is a deficient number, since it is larger than the sum of its proper divisors (1).
131022024000431 is an equidigital number, since it uses as much as digits as its factorization.
131022024000431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 131022024000431 its reverse (134000420220131), we get a palindrome (265022444220562).
The spelling of 131022024000431 in words is "one hundred thirty-one trillion, twenty-two billion, twenty-four million, four hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •