Base | Representation |
---|---|
bin | 10001010000111111000011… |
… | …010101000001100100100001 |
3 | 100221212012221021211210121101 |
4 | 101100333003111001210201 |
5 | 34423100314444111221 |
6 | 425255333320554401 |
7 | 21665023255351441 |
oct | 2120770325014441 |
9 | 327765837753541 |
10 | 75934003894561 |
11 | 2221648066a77a |
12 | 8624628322a01 |
13 | 334a7132a5427 |
14 | 14a73226c8121 |
15 | 8ba33eb11d91 |
hex | 450fc3541921 |
75934003894561 has 2 divisors, whose sum is σ = 75934003894562. Its totient is φ = 75934003894560.
The previous prime is 75934003894523. The next prime is 75934003894583. The reversal of 75934003894561 is 16549830043957.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75225092097600 + 708911796961 = 8673240^2 + 841969^2 .
It is a cyclic number.
It is not a de Polignac number, because 75934003894561 - 27 = 75934003894433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 75934003894493 and 75934003894502.
It is not a weakly prime, because it can be changed into another prime (75934003844561) 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, 37967001947280 + 37967001947281.
It is an arithmetic number, because the mean of its divisors is an integer number (37967001947281).
Almost surely, 275934003894561 is an apocalyptic number.
It is an amenable number.
75934003894561 is a deficient number, since it is larger than the sum of its proper divisors (1).
75934003894561 is an equidigital number, since it uses as much as digits as its factorization.
75934003894561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97977600, while the sum is 64.
The spelling of 75934003894561 in words is "seventy-five trillion, nine hundred thirty-four billion, three million, eight hundred ninety-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •