Base | Representation |
---|---|
bin | 1001001000100001110110… |
… | …1011010001111110100111 |
3 | 1022120000111101221022012202 |
4 | 2102020131223101332213 |
5 | 2304012241121020033 |
6 | 33205142543405115 |
7 | 2054343243465611 |
oct | 222103553217647 |
9 | 38500441838182 |
10 | 10042131423143 |
11 | 3221931432896 |
12 | 11622955b379b |
13 | 57ac7997b5c1 |
14 | 26a082805db1 |
15 | 126343aec8e8 |
hex | 9221dad1fa7 |
10042131423143 has 4 divisors (see below), whose sum is σ = 10570664655960. Its totient is φ = 9513598190328.
The previous prime is 10042131423131. The next prime is 10042131423157. The reversal of 10042131423143 is 34132413124001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10042131423143 - 24 = 10042131423127 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 (10042131420143) 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 3 ways as a sum of consecutive naturals, for example, 264266616380 + ... + 264266616417.
It is an arithmetic number, because the mean of its divisors is an integer number (2642666163990).
Almost surely, 210042131423143 is an apocalyptic number.
10042131423143 is a deficient number, since it is larger than the sum of its proper divisors (528533232817).
10042131423143 is an equidigital number, since it uses as much as digits as its factorization.
10042131423143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528533232816.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 10042131423143 its reverse (34132413124001), we get a palindrome (44174544547144).
The spelling of 10042131423143 in words is "ten trillion, forty-two billion, one hundred thirty-one million, four hundred twenty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •