Base | Representation |
---|---|
bin | 1011100011101… |
… | …00011111011101 |
3 | 20202102101002211 |
4 | 11301310133131 |
5 | 144304234031 |
6 | 13341520421 |
7 | 2255012545 |
oct | 561643735 |
9 | 222371084 |
10 | 96946141 |
11 | 4a7a6086 |
12 | 28573111 |
13 | 171147a6 |
14 | cc38325 |
15 | 879ebb1 |
hex | 5c747dd |
96946141 has 4 divisors (see below), whose sum is σ = 98535484. Its totient is φ = 95356800.
The previous prime is 96946111. The next prime is 96946147. The reversal of 96946141 is 14164969.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 54096025 + 42850116 = 7355^2 + 6546^2 .
It is a cyclic number.
It is not a de Polignac number, because 96946141 - 27 = 96946013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 96946094 and 96946103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96946147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is an upside-down number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 794580 + ... + 794701.
It is an arithmetic number, because the mean of its divisors is an integer number (24633871).
Almost surely, 296946141 is an apocalyptic number.
It is an amenable number.
96946141 is a deficient number, since it is larger than the sum of its proper divisors (1589343).
96946141 is a wasteful number, since it uses less digits than its factorization.
96946141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1589342.
The product of its digits is 46656, while the sum is 40.
The square root of 96946141 is about 9846.1231456853. The cubic root of 96946141 is about 459.3850336155.
The spelling of 96946141 in words is "ninety-six million, nine hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •