Base | Representation |
---|---|
bin | 100100110000101011011… |
… | …1010000011011100100001 |
3 | 122212222222020022020200221 |
4 | 1021201112322003130201 |
5 | 1130234142414133022 |
6 | 14425002431443041 |
7 | 1031006454004465 |
oct | 111412672033441 |
9 | 18788866266627 |
10 | 5052339599137 |
11 | 1678759a98016 |
12 | 697216386481 |
13 | 2a858376237c |
14 | 13676aad24a5 |
15 | 8b6526aacc7 |
hex | 49856e83721 |
5052339599137 has 2 divisors, whose sum is σ = 5052339599138. Its totient is φ = 5052339599136.
The previous prime is 5052339599117. The next prime is 5052339599159. The reversal of 5052339599137 is 7319959332505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3987885186961 + 1064454412176 = 1996969^2 + 1031724^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5052339599137 is a prime.
It is a super-2 number, since 2×50523395991372 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5052339599117) 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, 2526169799568 + 2526169799569.
It is an arithmetic number, because the mean of its divisors is an integer number (2526169799569).
Almost surely, 25052339599137 is an apocalyptic number.
It is an amenable number.
5052339599137 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052339599137 is an equidigital number, since it uses as much as digits as its factorization.
5052339599137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34445250, while the sum is 61.
The spelling of 5052339599137 in words is "five trillion, fifty-two billion, three hundred thirty-nine million, five hundred ninety-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.970 sec. • engine limits •