Base | Representation |
---|---|
bin | 100000010111001101001010… |
… | …000101101101110101000001 |
3 | 200122221211012020200211101002 |
4 | 200113031022011231311001 |
5 | 122123432233021001221 |
6 | 1222414254340221345 |
7 | 41660105500144220 |
oct | 4027151205556501 |
9 | 618854166624332 |
10 | 142332164234561 |
11 | 41395806133864 |
12 | 13b68b1599a855 |
13 | 6155b33656b12 |
14 | 2720cb0934cb7 |
15 | 116c5bd7a680b |
hex | 81734a16dd41 |
142332164234561 has 8 divisors (see below), whose sum is σ = 162686714252160. Its totient is φ = 121982960141568.
The previous prime is 142332164234549. The next prime is 142332164234573. The reversal of 142332164234561 is 165432461233241.
It is an interprime number because it is at equal distance from previous prime (142332164234549) and next prime (142332164234573).
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 142332164234561 - 210 = 142332164233537 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (142332164234461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1336424096 + ... + 1336530593.
It is an arithmetic number, because the mean of its divisors is an integer number (20335839281520).
Almost surely, 2142332164234561 is an apocalyptic number.
It is an amenable number.
142332164234561 is a deficient number, since it is larger than the sum of its proper divisors (20354550017599).
142332164234561 is an equidigital number, since it uses as much as digits as its factorization.
142332164234561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2672962303.
The product of its digits is 2488320, while the sum is 47.
The spelling of 142332164234561 in words is "one hundred forty-two trillion, three hundred thirty-two billion, one hundred sixty-four million, two hundred thirty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •