Base | Representation |
---|---|
bin | 100100110000100010110… |
… | …1010101000011000001101 |
3 | 122212222020002000112110212 |
4 | 1021201011222220120031 |
5 | 1130233044341442222 |
6 | 14424514020012205 |
7 | 1030666342244426 |
oct | 111410552503015 |
9 | 18788202015425 |
10 | 5052050343437 |
11 | 1678620791a19 |
12 | 697155531065 |
13 | 2a8538856b56 |
14 | 13674051864d |
15 | 8b6370c06e2 |
hex | 49845aa860d |
5052050343437 has 2 divisors, whose sum is σ = 5052050343438. Its totient is φ = 5052050343436.
The previous prime is 5052050343419. The next prime is 5052050343521. The reversal of 5052050343437 is 7343430502505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2718445810441 + 2333604532996 = 1648771^2 + 1527614^2 .
It is a cyclic number.
It is not a de Polignac number, because 5052050343437 - 220 = 5052049294861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5052050343394 and 5052050343403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5052050313437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526025171718 + 2526025171719.
It is an arithmetic number, because the mean of its divisors is an integer number (2526025171719).
Almost surely, 25052050343437 is an apocalyptic number.
It is an amenable number.
5052050343437 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052050343437 is an equidigital number, since it uses as much as digits as its factorization.
5052050343437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756000, while the sum is 41.
The spelling of 5052050343437 in words is "five trillion, fifty-two billion, fifty million, three hundred forty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •