Base | Representation |
---|---|
bin | 10000111100011… |
… | …10010000000101 |
3 | 100220110111000001 |
4 | 20132032100011 |
5 | 242341443141 |
6 | 22034321301 |
7 | 3344113363 |
oct | 1036162005 |
9 | 326414001 |
10 | 142140421 |
11 | 73264225 |
12 | 3b729231 |
13 | 235a9677 |
14 | 14c40633 |
15 | c72aa31 |
hex | 878e405 |
142140421 has 8 divisors (see below), whose sum is σ = 146917880. Its totient is φ = 137412288.
The previous prime is 142140419. The next prime is 142140457. The reversal of 142140421 is 124041241.
It can be written as a sum of positive squares in 4 ways, for example, as 13771521 + 128368900 = 3711^2 + 11330^2 .
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 142140421 - 21 = 142140419 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 (142140461) 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 7 ways as a sum of consecutive naturals, for example, 6426 + ... + 18043.
It is an arithmetic number, because the mean of its divisors is an integer number (18364735).
Almost surely, 2142140421 is an apocalyptic number.
It is an amenable number.
142140421 is a deficient number, since it is larger than the sum of its proper divisors (4777459).
142140421 is a wasteful number, since it uses less digits than its factorization.
142140421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24663.
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 142140421 is about 11922.2657662040. The cubic root of 142140421 is about 521.8822576638.
Adding to 142140421 its reverse (124041241), we get a palindrome (266181662).
The spelling of 142140421 in words is "one hundred forty-two million, one hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •