Base | Representation |
---|---|
bin | 100000010100010001110101… |
… | …101111100001001110001111 |
3 | 200122020121001002002010000220 |
4 | 200110101311233201032033 |
5 | 122112133323441302401 |
6 | 1222142032323122423 |
7 | 41636425333141500 |
oct | 4024216557411617 |
9 | 618217032063026 |
10 | 142131033150351 |
11 | 41318483957323 |
12 | 13b35b43513413 |
13 | 613cb8bbc265b |
14 | 2715270542ba7 |
15 | 116724adab336 |
hex | 814475be138f |
142131033150351 has 48 divisors (see below), whose sum is σ = 225545893567488. Its totient is φ = 79357245912000.
The previous prime is 142131033150349. The next prime is 142131033150391. The reversal of 142131033150351 is 153051330131241.
It is not a de Polignac number, because 142131033150351 - 21 = 142131033150349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142131033150341) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 51130935 + ... + 53838968.
It is an arithmetic number, because the mean of its divisors is an integer number (4698872782656).
Almost surely, 2142131033150351 is an apocalyptic number.
142131033150351 is a deficient number, since it is larger than the sum of its proper divisors (83414860417137).
142131033150351 is a wasteful number, since it uses less digits than its factorization.
142131033150351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104970132 (or 104970125 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 33.
Adding to 142131033150351 its reverse (153051330131241), we get a palindrome (295182363281592).
The spelling of 142131033150351 in words is "one hundred forty-two trillion, one hundred thirty-one billion, thirty-three million, one hundred fifty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •