Base | Representation |
---|---|
bin | 1001001000100010111100… |
… | …0101001000001100101111 |
3 | 1022120001020202100211221110 |
4 | 2102020233011020030233 |
5 | 2304013340343132003 |
6 | 33205231534003103 |
7 | 2054353420366620 |
oct | 222105705101457 |
9 | 38501222324843 |
10 | 10042423411503 |
11 | 3221a71234a8a |
12 | 1162357346493 |
13 | 57acc5302892 |
14 | 26a0ad4d1a47 |
15 | 12635e577a03 |
hex | 9222f14832f |
10042423411503 has 8 divisors (see below), whose sum is σ = 15302740436608. Its totient is φ = 5738527663704.
The previous prime is 10042423411439. The next prime is 10042423411561. The reversal of 10042423411503 is 30511432424001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10042423411503 - 26 = 10042423411439 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 (10042423411903) 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 7 ways as a sum of consecutive naturals, for example, 239105319301 + ... + 239105319342.
It is an arithmetic number, because the mean of its divisors is an integer number (1912842554576).
Almost surely, 210042423411503 is an apocalyptic number.
10042423411503 is a deficient number, since it is larger than the sum of its proper divisors (5260317025105).
10042423411503 is an equidigital number, since it uses as much as digits as its factorization.
10042423411503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478210638653.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 10042423411503 its reverse (30511432424001), we get a palindrome (40553855835504).
The spelling of 10042423411503 in words is "ten trillion, forty-two billion, four hundred twenty-three million, four hundred eleven thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •