Base | Representation |
---|---|
bin | 1000010010101101011… |
… | …1100001001110011101 |
3 | 111121201101110100211011 |
4 | 2010223113201032131 |
5 | 4313230121201321 |
6 | 145240152255221 |
7 | 13202220552661 |
oct | 2045327411635 |
9 | 447641410734 |
10 | 142461506461 |
11 | 554658963aa |
12 | 2373a0a1511 |
13 | 105848344b1 |
14 | 6c764dc8a1 |
15 | 3a8bd96ae1 |
hex | 212b5e139d |
142461506461 has 8 divisors (see below), whose sum is σ = 144512408448. Its totient is φ = 140411838000.
The previous prime is 142461506459. The next prime is 142461506497. The reversal of 142461506461 is 164605164241.
It is a happy number.
142461506461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 142461506461 - 21 = 142461506459 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 (142461506861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74470 + ... + 538951.
It is an arithmetic number, because the mean of its divisors is an integer number (18064051056).
Almost surely, 2142461506461 is an apocalyptic number.
It is an amenable number.
142461506461 is a deficient number, since it is larger than the sum of its proper divisors (2050901987).
142461506461 is an equidigital number, since it uses as much as digits as its factorization.
142461506461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616763.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 142461506461 in words is "one hundred forty-two billion, four hundred sixty-one million, five hundred six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •