Base | Representation |
---|---|
bin | 100000011001101011101010… |
… | …110001000000100100001110 |
3 | 200200120002111201221121100021 |
4 | 200121223222301000210032 |
5 | 122134224320044200411 |
6 | 1223024403200452354 |
7 | 42005312262335233 |
oct | 4031535261004416 |
9 | 620502451847307 |
10 | 142502363662606 |
11 | 41450a052931a2 |
12 | 13b95ab531a0ba |
13 | 6168bb89c7a5c |
14 | 2729218c8178a |
15 | 1171c30896a71 |
hex | 819aeac4090e |
142502363662606 has 8 divisors (see below), whose sum is σ = 213784873895664. Its totient is φ = 71240739030720.
The previous prime is 142502363662591. The next prime is 142502363662621. The reversal of 142502363662606 is 606266363205241.
It is an interprime number because it is at equal distance from previous prime (142502363662591) and next prime (142502363662621).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1425023636626062 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5221383235 + ... + 5221410526.
It is an arithmetic number, because the mean of its divisors is an integer number (26723109236958).
Almost surely, 2142502363662606 is an apocalyptic number.
142502363662606 is a deficient number, since it is larger than the sum of its proper divisors (71282510233058).
142502363662606 is a wasteful number, since it uses less digits than its factorization.
142502363662606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10442800586.
The product of its (nonzero) digits is 11197440, while the sum is 52.
The spelling of 142502363662606 in words is "one hundred forty-two trillion, five hundred two billion, three hundred sixty-three million, six hundred sixty-two thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •