Base | Representation |
---|---|
bin | 100000011000100100111011… |
… | …101001110000010000110100 |
3 | 200200021211110111012000111002 |
4 | 200120210323221300100310 |
5 | 122132003242243211423 |
6 | 1222525442354102432 |
7 | 41666653150052330 |
oct | 4030447351602064 |
9 | 620254414160432 |
10 | 142426411303988 |
11 | 4142177a14aa89 |
12 | 13b83238b7aa18 |
13 | 61619a3325316 |
14 | 27256918dc7c0 |
15 | 116ec8790e228 |
hex | 81893ba70434 |
142426411303988 has 12 divisors (see below), whose sum is σ = 284852822608032. Its totient is φ = 61039890558840.
The previous prime is 142426411303987. The next prime is 142426411303991. The reversal of 142426411303988 is 889303114624241.
142426411303988 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142426411303987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2543328773258 + ... + 2543328773313.
It is an arithmetic number, because the mean of its divisors is an integer number (23737735217336).
Almost surely, 2142426411303988 is an apocalyptic number.
It is an amenable number.
142426411303988 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142426411303988 is a wasteful number, since it uses less digits than its factorization.
142426411303988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5086657546582 (or 5086657546580 counting only the distinct ones).
The product of its (nonzero) digits is 7962624, while the sum is 56.
The spelling of 142426411303988 in words is "one hundred forty-two trillion, four hundred twenty-six billion, four hundred eleven million, three hundred three thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •