Base | Representation |
---|---|
bin | 10011001111011111011011… |
… | …00000101000001001101111 |
3 | 12112211011002000221102012221 |
4 | 21213233231200220021233 |
5 | 21021231433120224114 |
6 | 225554352055340211 |
7 | 11625031056040252 |
oct | 1147575540501157 |
9 | 175734060842187 |
10 | 42313707586159 |
11 | 125341628a8559 |
12 | 48b481b081667 |
13 | 1a7c21c7c6759 |
14 | a63dcc7c7099 |
15 | 4d5a239ca524 |
hex | 267bed82826f |
42313707586159 has 2 divisors, whose sum is σ = 42313707586160. Its totient is φ = 42313707586158.
The previous prime is 42313707586141. The next prime is 42313707586177. The reversal of 42313707586159 is 95168570731324.
It is a balanced prime because it is at equal distance from previous prime (42313707586141) and next prime (42313707586177).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42313707586159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42313707586097 and 42313707586106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42313707586109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21156853793079 + 21156853793080.
It is an arithmetic number, because the mean of its divisors is an integer number (21156853793080).
It is a 1-persistent number, because it is pandigital, but 2⋅42313707586159 = 84627415172318 is not.
Almost surely, 242313707586159 is an apocalyptic number.
42313707586159 is a deficient number, since it is larger than the sum of its proper divisors (1).
42313707586159 is an equidigital number, since it uses as much as digits as its factorization.
42313707586159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38102400, while the sum is 61.
The spelling of 42313707586159 in words is "forty-two trillion, three hundred thirteen billion, seven hundred seven million, five hundred eighty-six thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •