Base | Representation |
---|---|
bin | 100000011000100100111011… |
… | …101001110000010001101011 |
3 | 200200021211110111012000120010 |
4 | 200120210323221300101223 |
5 | 122132003242243212133 |
6 | 1222525442354103003 |
7 | 41666653150052436 |
oct | 4030447351602153 |
9 | 620254414160503 |
10 | 142426411304043 |
11 | 4142177a150029 |
12 | 13b83238b7aa63 |
13 | 61619a3325359 |
14 | 27256918dc81d |
15 | 116ec8790e263 |
hex | 81893ba7046b |
142426411304043 has 8 divisors (see below), whose sum is σ = 189901968296400. Its totient is φ = 94950897590528.
The previous prime is 142426411304033. The next prime is 142426411304083. The reversal of 142426411304043 is 340403114624241.
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 142426411304043 - 24 = 142426411304027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142426411303992 and 142426411304010.
It is not an unprimeable number, because it can be changed into a prime (142426411304033) 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, 2148078 + ... + 17013731.
It is an arithmetic number, because the mean of its divisors is an integer number (23737746037050).
Almost surely, 2142426411304043 is an apocalyptic number.
142426411304043 is a deficient number, since it is larger than the sum of its proper divisors (47475556992357).
142426411304043 is a wasteful number, since it uses less digits than its factorization.
142426411304043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21639421.
The product of its (nonzero) digits is 221184, while the sum is 39.
Adding to 142426411304043 its reverse (340403114624241), we get a palindrome (482829525928284).
The spelling of 142426411304043 in words is "one hundred forty-two trillion, four hundred twenty-six billion, four hundred eleven million, three hundred four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •