Base | Representation |
---|---|
bin | 10111001110001101010100… |
… | …010100100010100011011110 |
3 | 111101121200002210110220221100 |
4 | 113032031110110202203132 |
5 | 101341310143123032032 |
6 | 1001114311534013530 |
7 | 30340516225214460 |
oct | 2716152424424336 |
9 | 441550083426840 |
10 | 102131442002142 |
11 | 2a5a67794a36a3 |
12 | b5559113472a6 |
13 | 44cac52248537 |
14 | 1b3128c494130 |
15 | bc1a1700097c |
hex | 5ce3545228de |
102131442002142 has 48 divisors (see below), whose sum is σ = 263892421578240. Its totient is φ = 27911698434576.
The previous prime is 102131442002113. The next prime is 102131442002189. The reversal of 102131442002142 is 241200244131201.
102131442002142 is a `hidden beast` number, since 1 + 0 + 2 + 1 + 3 + 1 + 442 + 0 + 0 + 214 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17621018842 + ... + 17621024637.
It is an arithmetic number, because the mean of its divisors is an integer number (5497758782880).
Almost surely, 2102131442002142 is an apocalyptic number.
102131442002142 is an abundant number, since it is smaller than the sum of its proper divisors (161760979576098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102131442002142 is a wasteful number, since it uses less digits than its factorization.
102131442002142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35242043517 (or 35242043514 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 102131442002142 its reverse (241200244131201), we get a palindrome (343331686133343).
The spelling of 102131442002142 in words is "one hundred two trillion, one hundred thirty-one billion, four hundred forty-two million, two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •