Base | Representation |
---|---|
bin | 10010000101010111011100… |
… | …10110101001001000000001 |
3 | 12012210200002002112111100101 |
4 | 21002223232112221020001 |
5 | 20203014404332430033 |
6 | 220324341334322401 |
7 | 11243025345660634 |
oct | 1102535626511001 |
9 | 165720062474311 |
10 | 39766806139393 |
11 | 1174200a390123 |
12 | 45630a6ab9401 |
13 | 1925cbc2b4268 |
14 | 9b6a1bb21c1b |
15 | 48e65c58497d |
hex | 242aee5a9201 |
39766806139393 has 2 divisors, whose sum is σ = 39766806139394. Its totient is φ = 39766806139392.
The previous prime is 39766806139373. The next prime is 39766806139441. The reversal of 39766806139393 is 39393160866793.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30373457708944 + 9393348430449 = 5511212^2 + 3064857^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-39766806139393 is a prime.
It is not a weakly prime, because it can be changed into another prime (39766806139363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19883403069696 + 19883403069697.
It is an arithmetic number, because the mean of its divisors is an integer number (19883403069697).
Almost surely, 239766806139393 is an apocalyptic number.
It is an amenable number.
39766806139393 is a deficient number, since it is larger than the sum of its proper divisors (1).
39766806139393 is an equidigital number, since it uses as much as digits as its factorization.
39766806139393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 714256704, while the sum is 73.
The spelling of 39766806139393 in words is "thirty-nine trillion, seven hundred sixty-six billion, eight hundred six million, one hundred thirty-nine thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •