Base | Representation |
---|---|
bin | 10001000010110… |
… | …01110100101101 |
3 | 100222000211210201 |
4 | 20201121310231 |
5 | 243100134003 |
6 | 22104233501 |
7 | 3354155362 |
oct | 1041316455 |
9 | 328024721 |
10 | 142974253 |
11 | 73783744 |
12 | 3ba6b891 |
13 | 2380c066 |
14 | 14dba469 |
15 | c842b1d |
hex | 8859d2d |
142974253 has 12 divisors (see below), whose sum is σ = 148010772. Its totient is φ = 138101760.
The previous prime is 142974203. The next prime is 142974277. The reversal of 142974253 is 352479241.
It is the 4882-nd star number.
It can be written as a sum of positive squares in 6 ways, for example, as 28869129 + 114105124 = 5373^2 + 10682^2 .
It is a de Polignac number, because none of the positive numbers 2k-142974253 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142974203) 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 11 ways as a sum of consecutive naturals, for example, 247501 + ... + 248077.
It is an arithmetic number, because the mean of its divisors is an integer number (12334231).
Almost surely, 2142974253 is an apocalyptic number.
It is an amenable number.
142974253 is a deficient number, since it is larger than the sum of its proper divisors (5036519).
142974253 is an equidigital number, since it uses as much as digits as its factorization.
142974253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832 (or 795 counting only the distinct ones).
The product of its digits is 60480, while the sum is 37.
The square root of 142974253 is about 11957.1841584882. The cubic root of 142974253 is about 522.9007668299.
The spelling of 142974253 in words is "one hundred forty-two million, nine hundred seventy-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •