Base | Representation |
---|---|
bin | 1011011111110… |
… | …11100010110001 |
3 | 20201111012112112 |
4 | 11233323202301 |
5 | 144142410422 |
6 | 13323135105 |
7 | 2250550325 |
oct | 557734261 |
9 | 221435475 |
10 | 96450737 |
11 | 4a497959 |
12 | 28374495 |
13 | 16ca0156 |
14 | cb49985 |
15 | 8702ee2 |
hex | 5bfb8b1 |
96450737 has 12 divisors (see below), whose sum is σ = 99720348. Its totient is φ = 93283200.
The previous prime is 96450733. The next prime is 96450751. The reversal of 96450737 is 73705469.
It can be written as a sum of positive squares in 6 ways, for example, as 82283041 + 14167696 = 9071^2 + 3764^2 .
It is not a de Polignac number, because 96450737 - 22 = 96450733 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 96450694 and 96450703.
It is not an unprimeable number, because it can be changed into a prime (96450733) 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 11 ways as a sum of consecutive naturals, for example, 304103 + ... + 304419.
It is an arithmetic number, because the mean of its divisors is an integer number (8310029).
Almost surely, 296450737 is an apocalyptic number.
It is an amenable number.
96450737 is a deficient number, since it is larger than the sum of its proper divisors (3269611).
96450737 is a wasteful number, since it uses less digits than its factorization.
96450737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580 (or 539 counting only the distinct ones).
The product of its (nonzero) digits is 158760, while the sum is 41.
The square root of 96450737 is about 9820.9336114241. The cubic root of 96450737 is about 458.6011965318.
The spelling of 96450737 in words is "ninety-six million, four hundred fifty thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •