Base | Representation |
---|---|
bin | 10001000000110… |
… | …00010001001101 |
3 | 100221112012110211 |
4 | 20200120101031 |
5 | 243013040431 |
6 | 22054402421 |
7 | 3351656503 |
oct | 1040302115 |
9 | 327465424 |
10 | 142705741 |
11 | 7360aa32 |
12 | 3b960411 |
13 | 23746a89 |
14 | 14d4a673 |
15 | c7dd2b1 |
hex | 881844d |
142705741 has 4 divisors (see below), whose sum is σ = 147309184. Its totient is φ = 138102300.
The previous prime is 142705727. The next prime is 142705753. The reversal of 142705741 is 147507241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 142705741 - 29 = 142705229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 4603411 = 142705741 / (1 + 4 + 2 + 7 + 0 + 5 + 7 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142705441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2301675 + ... + 2301736.
It is an arithmetic number, because the mean of its divisors is an integer number (36827296).
Almost surely, 2142705741 is an apocalyptic number.
It is an amenable number.
142705741 is a deficient number, since it is larger than the sum of its proper divisors (4603443).
142705741 is an equidigital number, since it uses as much as digits as its factorization.
142705741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4603442.
The product of its (nonzero) digits is 7840, while the sum is 31.
The square root of 142705741 is about 11945.9508202570. The cubic root of 142705741 is about 522.5732180691.
The spelling of 142705741 in words is "one hundred forty-two million, seven hundred five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •