Base | Representation |
---|---|
bin | 10000111101010… |
… | …10100110001001 |
3 | 100220200101021001 |
4 | 20132222212021 |
5 | 242404202041 |
6 | 22041015001 |
7 | 3345106021 |
oct | 1036524611 |
9 | 326611231 |
10 | 142256521 |
11 | 73333480 |
12 | 3b784461 |
13 | 2361a474 |
14 | 14c70a81 |
15 | c750131 |
hex | 87aa989 |
142256521 has 8 divisors (see below), whose sum is σ = 155552544. Its totient is φ = 129021120.
The previous prime is 142256507. The next prime is 142256533. The reversal of 142256521 is 125652241.
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 142256521 - 213 = 142248329 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 142256521.
It is not an unprimeable number, because it can be changed into a prime (142256501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10171 + ... + 19696.
It is an arithmetic number, because the mean of its divisors is an integer number (19444068).
Almost surely, 2142256521 is an apocalyptic number.
142256521 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142256521 is a deficient number, since it is larger than the sum of its proper divisors (13296023).
142256521 is a wasteful number, since it uses less digits than its factorization.
142256521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30311.
The product of its digits is 4800, while the sum is 28.
The square root of 142256521 is about 11927.1338132847. The cubic root of 142256521 is about 522.0243097754.
The spelling of 142256521 in words is "one hundred forty-two million, two hundred fifty-six thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •