Base | Representation |
---|---|
bin | 1000010100011111000… |
… | …0100001110101011111 |
3 | 111122221120201211110222 |
4 | 2011013300201311133 |
5 | 4320214040341412 |
6 | 145355325351555 |
7 | 13220063314424 |
oct | 2050760416537 |
9 | 448846654428 |
10 | 142937824607 |
11 | 5568a748266 |
12 | 238517085bb |
13 | 1062c417356 |
14 | 6cbd88bd4b |
15 | 3ab8ad3072 |
hex | 2147c21d5f |
142937824607 has 8 divisors (see below), whose sum is σ = 143749949040. Its totient is φ = 142125851520.
The previous prime is 142937824567. The next prime is 142937824643. The reversal of 142937824607 is 706428739241.
It is a happy number.
142937824607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 142937824607 - 236 = 74218347871 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 (142937824697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2245673 + ... + 2308445.
It is an arithmetic number, because the mean of its divisors is an integer number (17968743630).
Almost surely, 2142937824607 is an apocalyptic number.
142937824607 is a deficient number, since it is larger than the sum of its proper divisors (812124433).
142937824607 is a wasteful number, since it uses less digits than its factorization.
142937824607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75673.
The product of its (nonzero) digits is 4064256, while the sum is 53.
The spelling of 142937824607 in words is "one hundred forty-two billion, nine hundred thirty-seven million, eight hundred twenty-four thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •