Base | Representation |
---|---|
bin | 11101110101011001000000… |
… | …010100110110110101111111 |
3 | 122012120202221212222111010000 |
4 | 131311121000110312311333 |
5 | 114144240323001232033 |
6 | 1143022040131245343 |
7 | 36431530600433253 |
oct | 3565310024666577 |
9 | 565522855874100 |
10 | 131212330102143 |
11 | 3889892270a584 |
12 | 128719b3a49853 |
13 | 582a367511b04 |
14 | 24589d40b2263 |
15 | 10282019aca13 |
hex | 775640536d7f |
131212330102143 has 20 divisors (see below), whose sum is σ = 197034765257088. Its totient is φ = 87016903024320.
The previous prime is 131212330102129. The next prime is 131212330102169. The reversal of 131212330102143 is 341201033212131.
131212330102143 is a `hidden beast` number, since 1 + 3 + 1 + 212 + 3 + 301 + 0 + 2 + 143 = 666.
It is not a de Polignac number, because 131212330102143 - 221 = 131212328004991 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131212330102943) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4240574346 + ... + 4240605287.
Almost surely, 2131212330102143 is an apocalyptic number.
131212330102143 is a deficient number, since it is larger than the sum of its proper divisors (65822435154945).
131212330102143 is an equidigital number, since it uses as much as digits as its factorization.
131212330102143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8481179836 (or 8481179827 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 131212330102143 its reverse (341201033212131), we get a palindrome (472413363314274).
The spelling of 131212330102143 in words is "one hundred thirty-one trillion, two hundred twelve billion, three hundred thirty million, one hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •