Base | Representation |
---|---|
bin | 100000011000100100111011… |
… | …100101110010011001010001 |
3 | 200200021211110102020012002101 |
4 | 200120210323211302121101 |
5 | 122132003242011423040 |
6 | 1222525442315520401 |
7 | 41666653135161610 |
oct | 4030447345623121 |
9 | 620254412205071 |
10 | 142426410264145 |
11 | 414217795aa807 |
12 | 13b83238759101 |
13 | 61619a304cc27 |
14 | 272569170b877 |
15 | 116ec877a609a |
hex | 81893b972651 |
142426410264145 has 32 divisors (see below), whose sum is σ = 208305405907200. Its totient is φ = 91257606291456.
The previous prime is 142426410264143. The next prime is 142426410264157. The reversal of 142426410264145 is 541462014624241.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 142426410264145 - 21 = 142426410264143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142426410264095 and 142426410264104.
It is not an unprimeable number, because it can be changed into a prime (142426410264143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 860968080 + ... + 861133489.
It is an arithmetic number, because the mean of its divisors is an integer number (6509543934600).
Almost surely, 2142426410264145 is an apocalyptic number.
It is an amenable number.
142426410264145 is a deficient number, since it is larger than the sum of its proper divisors (65878995643055).
142426410264145 is a wasteful number, since it uses less digits than its factorization.
142426410264145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1722101737.
The product of its (nonzero) digits is 1474560, while the sum is 46.
Adding to 142426410264145 its reverse (541462014624241), we get a palindrome (683888424888386).
The spelling of 142426410264145 in words is "one hundred forty-two trillion, four hundred twenty-six billion, four hundred ten million, two hundred sixty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •