Base | Representation |
---|---|
bin | 100111001110000001… |
… | …000110110010110101 |
3 | 11000200210110122012101 |
4 | 213032001012302311 |
5 | 1142220420232013 |
6 | 31202351022101 |
7 | 3020360314342 |
oct | 471601066265 |
9 | 130623418171 |
10 | 42111102133 |
11 | 1694a68a351 |
12 | 81b2b0a931 |
13 | 3c81559819 |
14 | 2076b077c9 |
15 | 1166ee38dd |
hex | 9ce046cb5 |
42111102133 has 2 divisors, whose sum is σ = 42111102134. Its totient is φ = 42111102132.
The previous prime is 42111102107. The next prime is 42111102161. The reversal of 42111102133 is 33120111124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22191167089 + 19919935044 = 148967^2 + 141138^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42111102133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42111102133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42111102193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21055551066 + 21055551067.
It is an arithmetic number, because the mean of its divisors is an integer number (21055551067).
Almost surely, 242111102133 is an apocalyptic number.
It is an amenable number.
42111102133 is a deficient number, since it is larger than the sum of its proper divisors (1).
42111102133 is an equidigital number, since it uses as much as digits as its factorization.
42111102133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 42111102133 its reverse (33120111124), we get a palindrome (75231213257).
The spelling of 42111102133 in words is "forty-two billion, one hundred eleven million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •