Base | Representation |
---|---|
bin | 10100110111101011… |
… | …00001000011010101 |
3 | 1001220212010010100010 |
4 | 22123311201003111 |
5 | 140421313311320 |
6 | 5051445510433 |
7 | 544441046520 |
oct | 123365410325 |
9 | 31825103303 |
10 | 11204432085 |
11 | 482a678730 |
12 | 2208412419 |
13 | 10973a4092 |
14 | 7840c7bb7 |
15 | 4589c1ae0 |
hex | 29bd610d5 |
11204432085 has 64 divisors (see below), whose sum is σ = 22365020160. Its totient is φ = 4653396480.
The previous prime is 11204432081. The next prime is 11204432117. The reversal of 11204432085 is 58023440211.
11204432085 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11204432085 - 22 = 11204432081 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11204432081) 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 63 ways as a sum of consecutive naturals, for example, 3489961 + ... + 3493169.
It is an arithmetic number, because the mean of its divisors is an integer number (349453440).
Almost surely, 211204432085 is an apocalyptic number.
11204432085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11204432085 is a deficient number, since it is larger than the sum of its proper divisors (11160588075).
11204432085 is a wasteful number, since it uses less digits than its factorization.
11204432085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6258.
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 11204432085 its reverse (58023440211), we get a palindrome (69227872296).
The spelling of 11204432085 in words is "eleven billion, two hundred four million, four hundred thirty-two thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •