Base | Representation |
---|---|
bin | 101001110101010011111… |
… | …1011101110010000010001 |
3 | 202100122102101220120211012 |
4 | 1103222213323232100101 |
5 | 1223144420311134243 |
6 | 20121135405100305 |
7 | 1132246365016331 |
oct | 123524773562021 |
9 | 22318371816735 |
10 | 5749483693073 |
11 | 191738472416a |
12 | 78a356557695 |
13 | 329235329663 |
14 | 15c3c29bd0c1 |
15 | 9e855b83d18 |
hex | 53aa7eee411 |
5749483693073 has 2 divisors, whose sum is σ = 5749483693074. Its totient is φ = 5749483693072.
The previous prime is 5749483693021. The next prime is 5749483693099. The reversal of 5749483693073 is 3703963849475.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4841108863504 + 908374829569 = 2200252^2 + 953087^2 .
It is a cyclic number.
It is not a de Polignac number, because 5749483693073 - 210 = 5749483692049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5749483692994 and 5749483693012.
It is not a weakly prime, because it can be changed into another prime (5749483693273) 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, 2874741846536 + 2874741846537.
It is an arithmetic number, because the mean of its divisors is an integer number (2874741846537).
Almost surely, 25749483693073 is an apocalyptic number.
It is an amenable number.
5749483693073 is a deficient number, since it is larger than the sum of its proper divisors (1).
5749483693073 is an equidigital number, since it uses as much as digits as its factorization.
5749483693073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 411505920, while the sum is 68.
The spelling of 5749483693073 in words is "five trillion, seven hundred forty-nine billion, four hundred eighty-three million, six hundred ninety-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •