Base | Representation |
---|---|
bin | 1000010001001011001… |
… | …0011001111110110101 |
3 | 111120122122111011210221 |
4 | 2010102302121332311 |
5 | 4311404033434102 |
6 | 145131221414341 |
7 | 13156052430364 |
oct | 2042262317665 |
9 | 446578434727 |
10 | 142049124277 |
11 | 55274033585 |
12 | 23643b6a3b1 |
13 | 1051a278c78 |
14 | 6c378337db |
15 | 3a65a89637 |
hex | 2112c99fb5 |
142049124277 has 6 divisors (see below), whose sum is σ = 145890644354. Its totient is φ = 138207728160.
The previous prime is 142049124257. The next prime is 142049124289. The reversal of 142049124277 is 772421940241.
142049124277 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 106911996676 + 35137127601 = 326974^2 + 187449^2 .
It is a de Polignac number, because none of the positive numbers 2k-142049124277 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 (142049124257) 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 5 ways as a sum of consecutive naturals, for example, 2261577 + ... + 2323537.
Almost surely, 2142049124277 is an apocalyptic number.
It is an amenable number.
142049124277 is a deficient number, since it is larger than the sum of its proper divisors (3841520077).
142049124277 is an frugal number, since it uses more digits than its factorization.
142049124277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123959 (or 61998 counting only the distinct ones).
The product of its (nonzero) digits is 225792, while the sum is 43.
The spelling of 142049124277 in words is "one hundred forty-two billion, forty-nine million, one hundred twenty-four thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •