Base | Representation |
---|---|
bin | 101100110101100010… |
… | …1011110010001110001 |
3 | 100012112022212100210222 |
4 | 1121223011132101301 |
5 | 3034143141033421 |
6 | 112122204302425 |
7 | 6646024311422 |
oct | 1315305362161 |
9 | 305468770728 |
10 | 96285877361 |
11 | 3791a95a863 |
12 | 167b1b41a15 |
13 | 91061b293b |
14 | 4935a85649 |
15 | 2788133cab |
hex | 166b15e471 |
96285877361 has 2 divisors, whose sum is σ = 96285877362. Its totient is φ = 96285877360.
The previous prime is 96285877327. The next prime is 96285877409. The reversal of 96285877361 is 16377858269.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91603075600 + 4682801761 = 302660^2 + 68431^2 .
It is an emirp because it is prime and its reverse (16377858269) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 96285877361 - 26 = 96285877297 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 96285877294 and 96285877303.
It is not a weakly prime, because it can be changed into another prime (96285870361) 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, 48142938680 + 48142938681.
It is an arithmetic number, because the mean of its divisors is an integer number (48142938681).
Almost surely, 296285877361 is an apocalyptic number.
It is an amenable number.
96285877361 is a deficient number, since it is larger than the sum of its proper divisors (1).
96285877361 is an equidigital number, since it uses as much as digits as its factorization.
96285877361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30481920, while the sum is 62.
The spelling of 96285877361 in words is "ninety-six billion, two hundred eighty-five million, eight hundred seventy-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •