Base | Representation |
---|---|
bin | 10001000010000… |
… | …01101111010111 |
3 | 100221211211111011 |
4 | 20201001233113 |
5 | 243034004412 |
6 | 22102153051 |
7 | 3353264650 |
oct | 1041015727 |
9 | 327754434 |
10 | 142875607 |
11 | 73716616 |
12 | 3ba22787 |
13 | 237a61a4 |
14 | 14d92527 |
15 | c8237a7 |
hex | 8841bd7 |
142875607 has 4 divisors (see below), whose sum is σ = 163286416. Its totient is φ = 122464800.
The previous prime is 142875589. The next prime is 142875647. The reversal of 142875607 is 706578241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 706578241 = 4783 ⋅147727.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142875607 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 142875607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142875647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10205394 + ... + 10205407.
It is an arithmetic number, because the mean of its divisors is an integer number (40821604).
Almost surely, 2142875607 is an apocalyptic number.
142875607 is a deficient number, since it is larger than the sum of its proper divisors (20410809).
142875607 is an equidigital number, since it uses as much as digits as its factorization.
142875607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20410808.
The product of its (nonzero) digits is 94080, while the sum is 40.
The square root of 142875607 is about 11953.0584788999. The cubic root of 142875607 is about 522.7804795856.
The spelling of 142875607 in words is "one hundred forty-two million, eight hundred seventy-five thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •