Base | Representation |
---|---|
bin | 10101111001000011110010… |
… | …100100001100001101000101 |
3 | 110121220021122200022002122022 |
4 | 111321003302210030031011 |
5 | 100104423023424334311 |
6 | 540434240343012525 |
7 | 26165001361013141 |
oct | 2571036244141505 |
9 | 417807580262568 |
10 | 96280056480581 |
11 | 2875016295a556 |
12 | a96b87813a145 |
13 | 419522a3b855c |
14 | 19abda0032221 |
15 | b1e6ea1b25db |
hex | 5790f290c345 |
96280056480581 has 2 divisors, whose sum is σ = 96280056480582. Its totient is φ = 96280056480580.
The previous prime is 96280056480563. The next prime is 96280056480653. The reversal of 96280056480581 is 18508465008269.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81898137958081 + 14381918522500 = 9049759^2 + 3792350^2 .
It is a cyclic number.
It is not a de Polignac number, because 96280056480581 - 214 = 96280056464197 is a prime.
It is a super-2 number, since 2×962800564805812 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (96280056480551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48140028240290 + 48140028240291.
It is an arithmetic number, because the mean of its divisors is an integer number (48140028240291).
Almost surely, 296280056480581 is an apocalyptic number.
It is an amenable number.
96280056480581 is a deficient number, since it is larger than the sum of its proper divisors (1).
96280056480581 is an equidigital number, since it uses as much as digits as its factorization.
96280056480581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33177600, while the sum is 62.
The spelling of 96280056480581 in words is "ninety-six trillion, two hundred eighty billion, fifty-six million, four hundred eighty thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •