Base | Representation |
---|---|
bin | 100000010111100111010001… |
… | …001010011100100010110111 |
3 | 200200001111120010022120011011 |
4 | 200113213101022130202313 |
5 | 122124412142222434143 |
6 | 1222435212332253051 |
7 | 41662120321013650 |
oct | 4027472112344267 |
9 | 620044503276134 |
10 | 142360200202423 |
11 | 413a6692767435 |
12 | 13b7243b011187 |
13 | 6158680b59008 |
14 | 27223b01a8527 |
15 | 116d1aec74e9d |
hex | 8179d129c8b7 |
142360200202423 has 16 divisors (see below), whose sum is σ = 171394502929920. Its totient is φ = 115510238670816.
The previous prime is 142360200202403. The next prime is 142360200202447. The reversal of 142360200202423 is 324202002063241.
It is a cyclic number.
It is not a de Polignac number, because 142360200202423 - 217 = 142360200071351 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 (142360200202403) 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 15 ways as a sum of consecutive naturals, for example, 418928611 + ... + 419268292.
It is an arithmetic number, because the mean of its divisors is an integer number (10712156433120).
Almost surely, 2142360200202423 is an apocalyptic number.
142360200202423 is a deficient number, since it is larger than the sum of its proper divisors (29034302727497).
142360200202423 is a wasteful number, since it uses less digits than its factorization.
142360200202423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838198206.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 142360200202423 its reverse (324202002063241), we get a palindrome (466562202265664).
The spelling of 142360200202423 in words is "one hundred forty-two trillion, three hundred sixty billion, two hundred million, two hundred two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •