Base | Representation |
---|---|
bin | 100000010111100111010001… |
… | …001010110100101011001101 |
3 | 200200001111120010111120201211 |
4 | 200113213101022310223031 |
5 | 122124412142234120021 |
6 | 1222435212334334421 |
7 | 41662120321605055 |
oct | 4027472112645315 |
9 | 620044503446654 |
10 | 142360200301261 |
11 | 413a6692824718 |
12 | 13b7243b05a411 |
13 | 6158680b91cb7 |
14 | 27223b01d2565 |
15 | 116d1aec943e1 |
hex | 8179d12b4acd |
142360200301261 has 8 divisors (see below), whose sum is σ = 149915885314880. Its totient is φ = 134810819576928.
The previous prime is 142360200301259. The next prime is 142360200301303. The reversal of 142360200301261 is 162103002063241.
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 142360200301261 - 21 = 142360200301259 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 (142360200301061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1576025961 + ... + 1576116286.
It is an arithmetic number, because the mean of its divisors is an integer number (18739485664360).
Almost surely, 2142360200301261 is an apocalyptic number.
It is an amenable number.
142360200301261 is a deficient number, since it is larger than the sum of its proper divisors (7555685013619).
142360200301261 is a wasteful number, since it uses less digits than its factorization.
142360200301261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3152144643.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 142360200301261 in words is "one hundred forty-two trillion, three hundred sixty billion, two hundred million, three hundred one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •