Base | Representation |
---|---|
bin | 10011011111011101111011… |
… | …01111111011111111111011 |
3 | 12121202122000121201110110211 |
4 | 21233232331233323333323 |
5 | 21104230212444412011 |
6 | 231054500220051551 |
7 | 12012503503343566 |
oct | 1157567557737773 |
9 | 177678017643424 |
10 | 42862662107131 |
11 | 12725a53372149 |
12 | 49830a2993bb7 |
13 | 1abbc15c126a9 |
14 | a827c75514dd |
15 | 4e4e522dbb21 |
hex | 26fbbdbfbffb |
42862662107131 has 4 divisors (see below), whose sum is σ = 43102118320200. Its totient is φ = 42623205894064.
The previous prime is 42862662107123. The next prime is 42862662107137. The reversal of 42862662107131 is 13170126626824.
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 42862662107131 - 23 = 42862662107123 is a prime.
It is a super-2 number, since 2×428626621071312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42862662107137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (37) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119728106266 + ... + 119728106623.
It is an arithmetic number, because the mean of its divisors is an integer number (10775529580050).
Almost surely, 242862662107131 is an apocalyptic number.
42862662107131 is a deficient number, since it is larger than the sum of its proper divisors (239456213069).
42862662107131 is a wasteful number, since it uses less digits than its factorization.
42862662107131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239456213068.
The product of its (nonzero) digits is 1161216, while the sum is 49.
The spelling of 42862662107131 in words is "forty-two trillion, eight hundred sixty-two billion, six hundred sixty-two million, one hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •