Base | Representation |
---|---|
bin | 10001000001001… |
… | …10110001001011 |
3 | 100221122012221110 |
4 | 20200212301023 |
5 | 243021441011 |
6 | 22055541403 |
7 | 3352324605 |
oct | 1040466113 |
9 | 327565843 |
10 | 142765131 |
11 | 73650613 |
12 | 3b98a863 |
13 | 23767b12 |
14 | 14d64175 |
15 | c800ba6 |
hex | 8826c4b |
142765131 has 16 divisors (see below), whose sum is σ = 191945600. Its totient is φ = 94385088.
The previous prime is 142765123. The next prime is 142765153. The reversal of 142765131 is 131567241.
It is not a de Polignac number, because 142765131 - 23 = 142765123 is a prime.
It is a super-2 number, since 2×1427651312 = 40763765258894322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142765111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 348855 + ... + 349263.
It is an arithmetic number, because the mean of its divisors is an integer number (11996600).
Almost surely, 2142765131 is an apocalyptic number.
142765131 is a deficient number, since it is larger than the sum of its proper divisors (49180469).
142765131 is a wasteful number, since it uses less digits than its factorization.
142765131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1098.
The product of its digits is 5040, while the sum is 30.
The square root of 142765131 is about 11948.4363412122. The cubic root of 142765131 is about 522.6457012988.
The spelling of 142765131 in words is "one hundred forty-two million, seven hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •