Base | Representation |
---|---|
bin | 1000010010011111010… |
… | …1000011101000110001 |
3 | 111121120020202021100001 |
4 | 2010213311003220301 |
5 | 4313114422000341 |
6 | 145230232030001 |
7 | 13200600140011 |
oct | 2044765035061 |
9 | 447506667301 |
10 | 142402140721 |
11 | 55435329005 |
12 | 23722232301 |
13 | 1057544a139 |
14 | 6c6c687c41 |
15 | 3a86a6bd31 |
hex | 2127d43a31 |
142402140721 has 8 divisors (see below), whose sum is σ = 150787859040. Its totient is φ = 134017435968.
The previous prime is 142402140719. The next prime is 142402140731. The reversal of 142402140721 is 127041204241.
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 142402140721 - 21 = 142402140719 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 142402140721.
It is not an unprimeable number, because it can be changed into a prime (142402140701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45990 + ... + 535648.
It is an arithmetic number, because the mean of its divisors is an integer number (18848482380).
Almost surely, 2142402140721 is an apocalyptic number.
It is an amenable number.
142402140721 is a deficient number, since it is larger than the sum of its proper divisors (8385718319).
142402140721 is a wasteful number, since it uses less digits than its factorization.
142402140721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506783.
The product of its (nonzero) digits is 3584, while the sum is 28.
Adding to 142402140721 its reverse (127041204241), we get a palindrome (269443344962).
The spelling of 142402140721 in words is "one hundred forty-two billion, four hundred two million, one hundred forty thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •