Base | Representation |
---|---|
bin | 1000010010100010101… |
… | …0000011001111110101 |
3 | 111121121012220001121220 |
4 | 2010220222003033311 |
5 | 4313132001022012 |
6 | 145231445500553 |
7 | 13201126206405 |
oct | 2045052031765 |
9 | 447535801556 |
10 | 142416032757 |
11 | 55442157329 |
12 | 23726a11759 |
13 | 105782a238b |
14 | 6c70462805 |
15 | 3a87db308c |
hex | 2128a833f5 |
142416032757 has 8 divisors (see below), whose sum is σ = 189968959776. Its totient is φ = 94903563792.
The previous prime is 142416032699. The next prime is 142416032767. The reversal of 142416032757 is 757230614241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142416032757 - 215 = 142415999989 is a prime.
It is a super-5 number, since 5×1424160327575 (a number of 57 digits) contains 55555 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142416032767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10106298 + ... + 10120379.
It is an arithmetic number, because the mean of its divisors is an integer number (23746119972).
Almost surely, 2142416032757 is an apocalyptic number.
It is an amenable number.
142416032757 is a deficient number, since it is larger than the sum of its proper divisors (47552927019).
142416032757 is a wasteful number, since it uses less digits than its factorization.
142416032757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20229027.
The product of its (nonzero) digits is 282240, while the sum is 42.
Adding to 142416032757 its reverse (757230614241), we get a palindrome (899646646998).
The spelling of 142416032757 in words is "one hundred forty-two billion, four hundred sixteen million, thirty-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •