Base | Representation |
---|---|
bin | 111000000000110000… |
… | …001010010001100010 |
3 | 12202020102002122101210 |
4 | 320000300022101202 |
5 | 1441132343322023 |
6 | 43343503210550 |
7 | 4226243662104 |
oct | 700060122142 |
9 | 182212078353 |
10 | 60142167138 |
11 | 2356275a369 |
12 | b7a55a6a56 |
13 | 5896045a61 |
14 | 2ca76dd574 |
15 | 186ee86593 |
hex | e00c0a462 |
60142167138 has 8 divisors (see below), whose sum is σ = 120284334288. Its totient is φ = 20047389044.
The previous prime is 60142167103. The next prime is 60142167139. The reversal of 60142167138 is 83176124106.
It is a sphenic number, since it is the product of 3 distinct primes.
60142167138 is an admirable number.
It is a super-2 number, since 2×601421671382 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 60142167096 and 60142167105.
It is not an unprimeable number, because it can be changed into a prime (60142167139) 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 3 ways as a sum of consecutive naturals, for example, 5011847256 + ... + 5011847267.
It is an arithmetic number, because the mean of its divisors is an integer number (15035541786).
Almost surely, 260142167138 is an apocalyptic number.
60142167138 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60142167138 is a wasteful number, since it uses less digits than its factorization.
60142167138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10023694528.
The product of its (nonzero) digits is 48384, while the sum is 39.
The spelling of 60142167138 in words is "sixty billion, one hundred forty-two million, one hundred sixty-seven thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •