Base | Representation |
---|---|
bin | 101101000111101100… |
… | …0111010011101101111 |
3 | 100021002202221121222002 |
4 | 1122033120322131233 |
5 | 3041420102001302 |
6 | 112302443042515 |
7 | 10000101341204 |
oct | 1321730723557 |
9 | 307082847862 |
10 | 96894953327 |
11 | 38102747627 |
12 | 16941b1043b |
13 | 91a2438613 |
14 | 4992911cab |
15 | 27c1845c02 |
hex | 168f63a76f |
96894953327 has 2 divisors, whose sum is σ = 96894953328. Its totient is φ = 96894953326.
The previous prime is 96894953317. The next prime is 96894953339. The reversal of 96894953327 is 72335949869.
It is a weak prime.
It is an emirp because it is prime and its reverse (72335949869) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 96894953327 - 222 = 96890759023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (96894953317) 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, 48447476663 + 48447476664.
It is an arithmetic number, because the mean of its divisors is an integer number (48447476664).
Almost surely, 296894953327 is an apocalyptic number.
96894953327 is a deficient number, since it is larger than the sum of its proper divisors (1).
96894953327 is an equidigital number, since it uses as much as digits as its factorization.
96894953327 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 88179840, while the sum is 65.
The spelling of 96894953327 in words is "ninety-six billion, eight hundred ninety-four million, nine hundred fifty-three thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •