Base | Representation |
---|---|
bin | 10011010110100101001101… |
… | …00010110011101100100011 |
3 | 12120200102220111200222110102 |
4 | 21223102212202303230203 |
5 | 21034224403002030032 |
6 | 230302322331453015 |
7 | 11651444212243616 |
oct | 1153224642635443 |
9 | 176612814628412 |
10 | 42557330111267 |
11 | 1261850a4204a4 |
12 | 4933a8b8b716b |
13 | 1a991a6533b5a |
14 | a71b0020a17d |
15 | 4dc031997362 |
hex | 26b4a68b3b23 |
42557330111267 has 2 divisors, whose sum is σ = 42557330111268. Its totient is φ = 42557330111266.
The previous prime is 42557330111207. The next prime is 42557330111273. The reversal of 42557330111267 is 76211103375524.
42557330111267 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42557330111267 is a prime.
It is a super-2 number, since 2×425573301112672 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42557330111207) 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 as a sum of consecutive naturals, namely, 21278665055633 + 21278665055634.
It is an arithmetic number, because the mean of its divisors is an integer number (21278665055634).
Almost surely, 242557330111267 is an apocalyptic number.
42557330111267 is a deficient number, since it is larger than the sum of its proper divisors (1).
42557330111267 is an equidigital number, since it uses as much as digits as its factorization.
42557330111267 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 42557330111267 in words is "forty-two trillion, five hundred fifty-seven billion, three hundred thirty million, one hundred eleven thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •