Base | Representation |
---|---|
bin | 10001111010001101111011… |
… | …10111010011101001101001 |
3 | 12011110001022121000021002011 |
4 | 20331012331313103221221 |
5 | 20130230400033414012 |
6 | 215432350213035521 |
7 | 11203244543006635 |
oct | 1075067567235151 |
9 | 164401277007064 |
10 | 39383740529257 |
11 | 11604606884553 |
12 | 45009bb025ba1 |
13 | 18c8b421a6967 |
14 | 9a227ca3ddc5 |
15 | 4846dc7031a7 |
hex | 23d1bddd3a69 |
39383740529257 has 2 divisors, whose sum is σ = 39383740529258. Its totient is φ = 39383740529256.
The previous prime is 39383740529251. The next prime is 39383740529281. The reversal of 39383740529257 is 75292504738393.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29049900921616 + 10333839607641 = 5389796^2 + 3214629^2 .
It is an emirp because it is prime and its reverse (75292504738393) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 39383740529257 - 227 = 39383606311529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 39383740529192 and 39383740529201.
It is not a weakly prime, because it can be changed into another prime (39383740529251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19691870264628 + 19691870264629.
It is an arithmetic number, because the mean of its divisors is an integer number (19691870264629).
Almost surely, 239383740529257 is an apocalyptic number.
It is an amenable number.
39383740529257 is a deficient number, since it is larger than the sum of its proper divisors (1).
39383740529257 is an equidigital number, since it uses as much as digits as its factorization.
39383740529257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 342921600, while the sum is 67.
The spelling of 39383740529257 in words is "thirty-nine trillion, three hundred eighty-three billion, seven hundred forty million, five hundred twenty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •