Base | Representation |
---|---|
bin | 100100101100000111010… |
… | …1010111011100111010001 |
3 | 122212001200010101020202221 |
4 | 1021120032222323213101 |
5 | 1130104104130201003 |
6 | 14420302043541041 |
7 | 1030211533410052 |
oct | 111301652734721 |
9 | 18761603336687 |
10 | 5042537740753 |
11 | 167458a106807 |
12 | 69533b82a781 |
13 | 2a7680b2b376 |
14 | 1360badca729 |
15 | 8b27bddb7bd |
hex | 4960eabb9d1 |
5042537740753 has 2 divisors, whose sum is σ = 5042537740754. Its totient is φ = 5042537740752.
The previous prime is 5042537740673. The next prime is 5042537740759. The reversal of 5042537740753 is 3570477352405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3997168501264 + 1045369239489 = 1999292^2 + 1022433^2 .
It is a cyclic number.
It is not a de Polignac number, because 5042537740753 - 221 = 5042535643601 is a prime.
It is a super-3 number, since 3×50425377407533 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5042537740753.
It is not a weakly prime, because it can be changed into another prime (5042537740759) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2521268870376 + 2521268870377.
It is an arithmetic number, because the mean of its divisors is an integer number (2521268870377).
Almost surely, 25042537740753 is an apocalyptic number.
It is an amenable number.
5042537740753 is a deficient number, since it is larger than the sum of its proper divisors (1).
5042537740753 is an equidigital number, since it uses as much as digits as its factorization.
5042537740753 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12348000, while the sum is 52.
The spelling of 5042537740753 in words is "five trillion, forty-two billion, five hundred thirty-seven million, seven hundred forty thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •