Base | Representation |
---|---|
bin | 10001000001110… |
… | …00001101110001 |
3 | 100221202211222012 |
4 | 20200320031301 |
5 | 243031232333 |
6 | 22101252305 |
7 | 3353043134 |
oct | 1040701561 |
9 | 327684865 |
10 | 142836593 |
11 | 7369a279 |
12 | 3ba04095 |
13 | 237914c3 |
14 | 14d8221b |
15 | c816e48 |
hex | 8838371 |
142836593 has 8 divisors (see below), whose sum is σ = 145069056. Its totient is φ = 140610400.
The previous prime is 142836587. The next prime is 142836599. The reversal of 142836593 is 395638241.
It is an interprime number because it is at equal distance from previous prime (142836587) and next prime (142836599).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142836593 - 212 = 142832497 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 142836593.
It is not an unprimeable number, because it can be changed into a prime (142836599) 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 7 ways as a sum of consecutive naturals, for example, 66608 + ... + 68718.
It is an arithmetic number, because the mean of its divisors is an integer number (18133632).
Almost surely, 2142836593 is an apocalyptic number.
It is an amenable number.
142836593 is a deficient number, since it is larger than the sum of its proper divisors (2232463).
142836593 is an equidigital number, since it uses as much as digits as its factorization.
142836593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3135.
The product of its digits is 155520, while the sum is 41.
The square root of 142836593 is about 11951.4264002252. The cubic root of 142836593 is about 522.7328913028.
The spelling of 142836593 in words is "one hundred forty-two million, eight hundred thirty-six thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •