Base | Representation |
---|---|
bin | 10100110111101010… |
… | …00110101100010001 |
3 | 1001220211220122020011 |
4 | 22123311012230101 |
5 | 140421301332423 |
6 | 5051443314521 |
7 | 544440116653 |
oct | 123365065421 |
9 | 31824818204 |
10 | 11204324113 |
11 | 482a6045a4 |
12 | 220837ba41 |
13 | 1097366ba8 |
14 | 78409a6d3 |
15 | 45899eb0d |
hex | 29bd46b11 |
11204324113 has 8 divisors (see below), whose sum is σ = 11879468640. Its totient is φ = 10530964800.
The previous prime is 11204324101. The next prime is 11204324137. The reversal of 11204324113 is 31142340211.
11204324113 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 11204324113 - 25 = 11204324081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11204321113) 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, 433363 + ... + 458488.
It is an arithmetic number, because the mean of its divisors is an integer number (1484933580).
Almost surely, 211204324113 is an apocalyptic number.
It is an amenable number.
11204324113 is a deficient number, since it is larger than the sum of its proper divisors (675144527).
11204324113 is an equidigital number, since it uses as much as digits as its factorization.
11204324113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 892607.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 11204324113 its reverse (31142340211), we get a palindrome (42346664324).
The spelling of 11204324113 in words is "eleven billion, two hundred four million, three hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •