Base | Representation |
---|---|
bin | 101101000010101110… |
… | …0010110100101010001 |
3 | 100020200010221201121001 |
4 | 1122011130112211101 |
5 | 3041044342122034 |
6 | 112234122302001 |
7 | 6663004065133 |
oct | 1320534264521 |
9 | 306603851531 |
10 | 96728082769 |
11 | 3802753227a |
12 | 168b6057901 |
13 | 91769b0846 |
14 | 49786b5053 |
15 | 27b1d82a14 |
hex | 1685716951 |
96728082769 has 8 divisors (see below), whose sum is σ = 98723778560. Its totient is φ = 94751669376.
The previous prime is 96728082767. The next prime is 96728082797.
96728082769 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 96728082769 - 21 = 96728082767 is a prime.
It is a super-2 number, since 2×967280827692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 96728082769.
It is not an unprimeable number, because it can be changed into a prime (96728082761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4810464 + ... + 4830529.
It is an arithmetic number, because the mean of its divisors is an integer number (12340472320).
Almost surely, 296728082769 is an apocalyptic number.
It is an amenable number.
96728082769 is a deficient number, since it is larger than the sum of its proper divisors (1995695791).
96728082769 is a wasteful number, since it uses less digits than its factorization.
96728082769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9641199.
The product of its (nonzero) digits is 36578304, while the sum is 64.
The spelling of 96728082769 in words is "ninety-six billion, seven hundred twenty-eight million, eighty-two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •