Base | Representation |
---|---|
bin | 101101000010110010… |
… | …0001100101110011111 |
3 | 100020200021211012222011 |
4 | 1122011210030232133 |
5 | 3041100403431201 |
6 | 112234234332051 |
7 | 6663030422443 |
oct | 1320544145637 |
9 | 306607735864 |
10 | 96730139551 |
11 | 380287075a1 |
12 | 168b688a027 |
13 | 9177250a86 |
14 | 4978a8c823 |
15 | 27b213c151 |
hex | 168590cb9f |
96730139551 has 2 divisors, whose sum is σ = 96730139552. Its totient is φ = 96730139550.
The previous prime is 96730139509. The next prime is 96730139629. The reversal of 96730139551 is 15593103769.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 96730139551 - 27 = 96730139423 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 96730139495 and 96730139504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (96730139351) 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, 48365069775 + 48365069776.
It is an arithmetic number, because the mean of its divisors is an integer number (48365069776).
Almost surely, 296730139551 is an apocalyptic number.
96730139551 is a deficient number, since it is larger than the sum of its proper divisors (1).
96730139551 is an equidigital number, since it uses as much as digits as its factorization.
96730139551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 765450, while the sum is 49.
The spelling of 96730139551 in words is "ninety-six billion, seven hundred thirty million, one hundred thirty-nine thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •