Base | Representation |
---|---|
bin | 10100010010111011… |
… | …10110001000011101 |
3 | 1001010101012012021111 |
4 | 22021131312020131 |
5 | 134303414041320 |
6 | 5001120102021 |
7 | 534006326026 |
oct | 121135661035 |
9 | 31111165244 |
10 | 10896237085 |
11 | 4691707218 |
12 | 2141164911 |
13 | 1048597186 |
14 | 7551bdc4d |
15 | 43b8e4a5a |
hex | 28977621d |
10896237085 has 8 divisors (see below), whose sum is σ = 13094632800. Its totient is φ = 8704224144.
The previous prime is 10896237083. The next prime is 10896237113. The reversal of 10896237085 is 58073269801.
10896237085 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10896237085 - 21 = 10896237083 is a prime.
It is a super-2 number, since 2×108962370852 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10896237083) 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, 1591935 + ... + 1598764.
It is an arithmetic number, because the mean of its divisors is an integer number (1636829100).
Almost surely, 210896237085 is an apocalyptic number.
It is an amenable number.
10896237085 is a deficient number, since it is larger than the sum of its proper divisors (2198395715).
10896237085 is an equidigital number, since it uses as much as digits as its factorization.
10896237085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3191387.
The product of its (nonzero) digits is 725760, while the sum is 49.
The spelling of 10896237085 in words is "ten billion, eight hundred ninety-six million, two hundred thirty-seven thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •