Base | Representation |
---|---|
bin | 100111001110000001… |
… | …001011011011001111 |
3 | 11000200210111121012222 |
4 | 213032001023123033 |
5 | 1142220421333403 |
6 | 31202351245555 |
7 | 3020360423552 |
oct | 471601133317 |
9 | 130623447188 |
10 | 42111121103 |
11 | 1694a6a2627 |
12 | 81b2b198bb |
13 | 3c8156534c |
14 | 2076b10699 |
15 | 1166ee9338 |
hex | 9ce04b6cf |
42111121103 has 8 divisors (see below), whose sum is σ = 42321905136. Its totient is φ = 41900443200.
The previous prime is 42111121097. The next prime is 42111121109. The reversal of 42111121103 is 30112111124.
It is an interprime number because it is at equal distance from previous prime (42111121097) and next prime (42111121109).
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 42111121103 - 220 = 42110072527 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 (42111121109) 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, 839243 + ... + 888003.
It is an arithmetic number, because the mean of its divisors is an integer number (5290238142).
Almost surely, 242111121103 is an apocalyptic number.
42111121103 is a deficient number, since it is larger than the sum of its proper divisors (210784033).
42111121103 is a wasteful number, since it uses less digits than its factorization.
42111121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53065.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 42111121103 its reverse (30112111124), we get a palindrome (72223232227).
The spelling of 42111121103 in words is "forty-two billion, one hundred eleven million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •