Base | Representation |
---|---|
bin | 10000111110000… |
… | …00100011000101 |
3 | 100220211221121021 |
4 | 20133000203011 |
5 | 242420041222 |
6 | 22042551141 |
7 | 3345632122 |
oct | 1037004305 |
9 | 326757537 |
10 | 142346437 |
11 | 73394a92 |
12 | 3b8084b1 |
13 | 2364c37c |
14 | 14c95749 |
15 | c76bac7 |
hex | 87c08c5 |
142346437 has 4 divisors (see below), whose sum is σ = 146193676. Its totient is φ = 138499200.
The previous prime is 142346429. The next prime is 142346447. The reversal of 142346437 is 734643241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 123632161 + 18714276 = 11119^2 + 4326^2 .
It is a cyclic number.
It is not a de Polignac number, because 142346437 - 23 = 142346429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142346447) 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 3 ways as a sum of consecutive naturals, for example, 1923564 + ... + 1923637.
It is an arithmetic number, because the mean of its divisors is an integer number (36548419).
Almost surely, 2142346437 is an apocalyptic number.
It is an amenable number.
142346437 is a deficient number, since it is larger than the sum of its proper divisors (3847239).
142346437 is an equidigital number, since it uses as much as digits as its factorization.
142346437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3847238.
The product of its digits is 48384, while the sum is 34.
The square root of 142346437 is about 11930.9026062574. The cubic root of 142346437 is about 522.1342718157.
Adding to 142346437 its reverse (734643241), we get a palindrome (876989678).
The spelling of 142346437 in words is "one hundred forty-two million, three hundred forty-six thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •