Base | Representation |
---|---|
bin | 100100111010100000100… |
… | …1100010111100000110101 |
3 | 122222000110110111201101211 |
4 | 1021311001030113200311 |
5 | 1131110411213401103 |
6 | 14442413311521421 |
7 | 1032354552426142 |
oct | 111650114274065 |
9 | 18860413451354 |
10 | 5073450137653 |
11 | 168670237a067 |
12 | 69b328229271 |
13 | 2aa56923a691 |
14 | 1377b069b3c9 |
15 | 8be8ab9036d |
hex | 49d41317835 |
5073450137653 has 2 divisors, whose sum is σ = 5073450137654. Its totient is φ = 5073450137652.
The previous prime is 5073450137627. The next prime is 5073450137669. The reversal of 5073450137653 is 3567310543705.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4834268497809 + 239181639844 = 2198697^2 + 489062^2 .
It is a cyclic number.
It is not a de Polignac number, because 5073450137653 - 233 = 5064860203061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5073450137597 and 5073450137606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5073450117653) 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, 2536725068826 + 2536725068827.
It is an arithmetic number, because the mean of its divisors is an integer number (2536725068827).
Almost surely, 25073450137653 is an apocalyptic number.
It is an amenable number.
5073450137653 is a deficient number, since it is larger than the sum of its proper divisors (1).
5073450137653 is an equidigital number, since it uses as much as digits as its factorization.
5073450137653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3969000, while the sum is 49.
The spelling of 5073450137653 in words is "five trillion, seventy-three billion, four hundred fifty million, one hundred thirty-seven thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •