Base | Representation |
---|---|
bin | 10101000101011110… |
… | …10011010001100110 |
3 | 1002012221000221110110 |
4 | 22202233103101212 |
5 | 141140440241202 |
6 | 5111144033450 |
7 | 550345323534 |
oct | 124257232146 |
9 | 32187027413 |
10 | 11320243302 |
11 | 4889a89385 |
12 | 223b162886 |
13 | 10b5392524 |
14 | 795633154 |
15 | 463c4b26c |
hex | 2a2bd3466 |
11320243302 has 8 divisors (see below), whose sum is σ = 22640486616. Its totient is φ = 3773414432.
The previous prime is 11320243289. The next prime is 11320243307. The reversal of 11320243302 is 20334202311.
11320243302 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.
11320243302 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11320243307) 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 3 ways as a sum of consecutive naturals, for example, 943353603 + ... + 943353614.
It is an arithmetic number, because the mean of its divisors is an integer number (2830060827).
Almost surely, 211320243302 is an apocalyptic number.
11320243302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11320243302 is a wasteful number, since it uses less digits than its factorization.
11320243302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1886707222.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 11320243302 its reverse (20334202311), we get a palindrome (31654445613).
The spelling of 11320243302 in words is "eleven billion, three hundred twenty million, two hundred forty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •