Base | Representation |
---|---|
bin | 100000010110001110101100… |
… | …110001111000100110100111 |
3 | 200122201102002110110022012120 |
4 | 200112032230301320212213 |
5 | 122121332411212102323 |
6 | 1222323403535521023 |
7 | 41652212545633260 |
oct | 4026165461704647 |
9 | 618642073408176 |
10 | 142265100503463 |
11 | 4136a321433003 |
12 | 13b57b1a389173 |
13 | 614c70663b6b2 |
14 | 271b94bc95967 |
15 | 116a995d4b5e3 |
hex | 8163acc789a7 |
142265100503463 has 16 divisors (see below), whose sum is σ = 216804081263616. Its totient is φ = 81287155815840.
The previous prime is 142265100503447. The next prime is 142265100503479. The reversal of 142265100503463 is 364305001562241.
It is an interprime number because it is at equal distance from previous prime (142265100503447) and next prime (142265100503479).
It is not a de Polignac number, because 142265100503463 - 24 = 142265100503447 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142265100503413) 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, 299228856 + ... + 299703917.
It is an arithmetic number, because the mean of its divisors is an integer number (13550255078976).
Almost surely, 2142265100503463 is an apocalyptic number.
142265100503463 is a deficient number, since it is larger than the sum of its proper divisors (74538980760153).
142265100503463 is a wasteful number, since it uses less digits than its factorization.
142265100503463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598944094.
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 142265100503463 in words is "one hundred forty-two trillion, two hundred sixty-five billion, one hundred million, five hundred three thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •