Base | Representation |
---|---|
bin | 10001000000010… |
… | …10100101101101 |
3 | 100221102100121120 |
4 | 20200022211231 |
5 | 243004242314 |
6 | 22053251153 |
7 | 3351334236 |
oct | 1040124555 |
9 | 327370546 |
10 | 142649709 |
11 | 73581924 |
12 | 3b933ab9 |
13 | 23727417 |
14 | 14d3408d |
15 | c7cb8a9 |
hex | 880a96d |
142649709 has 4 divisors (see below), whose sum is σ = 190199616. Its totient is φ = 95099804.
The previous prime is 142649707. The next prime is 142649711. The reversal of 142649709 is 907946241.
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 an interprime number because it is at equal distance from previous prime (142649707) and next prime (142649711).
It is a cyclic number.
It is not a de Polignac number, because 142649709 - 21 = 142649707 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142649707) 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, 23774949 + ... + 23774954.
It is an arithmetic number, because the mean of its divisors is an integer number (47549904).
Almost surely, 2142649709 is an apocalyptic number.
It is an amenable number.
142649709 is a deficient number, since it is larger than the sum of its proper divisors (47549907).
142649709 is an equidigital number, since it uses as much as digits as its factorization.
142649709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47549906.
The product of its (nonzero) digits is 108864, while the sum is 42.
The square root of 142649709 is about 11943.6053601917. The cubic root of 142649709 is about 522.5048147111.
The spelling of 142649709 in words is "one hundred forty-two million, six hundred forty-nine thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •