Base | Representation |
---|---|
bin | 111010000100101011111… |
… | …110110100001011010101 |
3 | 112010111212002201022220122 |
4 | 322010223332310023111 |
5 | 1010341040200124132 |
6 | 12253155254241325 |
7 | 561215546411426 |
oct | 72045376641325 |
9 | 15114762638818 |
10 | 3990762504917 |
11 | 12a9522438911 |
12 | 54552a356245 |
13 | 22c434093806 |
14 | db22258564d |
15 | 6dc20019912 |
hex | 3a12bfb42d5 |
3990762504917 has 2 divisors, whose sum is σ = 3990762504918. Its totient is φ = 3990762504916.
The previous prime is 3990762504893. The next prime is 3990762504947. The reversal of 3990762504917 is 7194052670993.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2250582037636 + 1740180467281 = 1500194^2 + 1319159^2 .
It is a cyclic number.
It is not a de Polignac number, because 3990762504917 - 26 = 3990762504853 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3990762504917.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3990762504947) 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, 1995381252458 + 1995381252459.
It is an arithmetic number, because the mean of its divisors is an integer number (1995381252459).
Almost surely, 23990762504917 is an apocalyptic number.
It is an amenable number.
3990762504917 is a deficient number, since it is larger than the sum of its proper divisors (1).
3990762504917 is an equidigital number, since it uses as much as digits as its factorization.
3990762504917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25719120, while the sum is 62.
The spelling of 3990762504917 in words is "three trillion, nine hundred ninety billion, seven hundred sixty-two million, five hundred four thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •