Base | Representation |
---|---|
bin | 10101110111101000101100… |
… | …011111010001010000001001 |
3 | 110121112221011221220100001122 |
4 | 111313220230133101100021 |
5 | 100101322213432140012 |
6 | 540321302442325025 |
7 | 26154636445562222 |
oct | 2567505437212011 |
9 | 417487157810048 |
10 | 96182244021257 |
11 | 2871272a314109 |
12 | a95491aab9775 |
13 | 4188c3cb673a4 |
14 | 19a7361728249 |
15 | b1bdc3032e72 |
hex | 577a2c7d1409 |
96182244021257 has 2 divisors, whose sum is σ = 96182244021258. Its totient is φ = 96182244021256.
The previous prime is 96182244021221. The next prime is 96182244021263. The reversal of 96182244021257 is 75212044228169.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88717485648016 + 7464758373241 = 9418996^2 + 2732171^2 .
It is a cyclic number.
It is not a de Polignac number, because 96182244021257 - 224 = 96182227244041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 96182244021199 and 96182244021208.
It is not a weakly prime, because it can be changed into another prime (96182244021287) 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, 48091122010628 + 48091122010629.
It is an arithmetic number, because the mean of its divisors is an integer number (48091122010629).
Almost surely, 296182244021257 is an apocalyptic number.
It is an amenable number.
96182244021257 is a deficient number, since it is larger than the sum of its proper divisors (1).
96182244021257 is an equidigital number, since it uses as much as digits as its factorization.
96182244021257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3870720, while the sum is 53.
The spelling of 96182244021257 in words is "ninety-six trillion, one hundred eighty-two billion, two hundred forty-four million, twenty-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •