Base | Representation |
---|---|
bin | 10101000100101001… |
… | …11001100100111110 |
3 | 1002012110000022122010 |
4 | 22202110321210332 |
5 | 141132202303202 |
6 | 5110335432050 |
7 | 550232436642 |
oct | 124224714476 |
9 | 32173008563 |
10 | 11313322302 |
11 | 4886091547 |
12 | 2238985626 |
13 | 10b3b0b269 |
14 | 794750c22 |
15 | 46333076c |
hex | 2a253993e |
11313322302 has 8 divisors (see below), whose sum is σ = 22626644616. Its totient is φ = 3771107432.
The previous prime is 11313322289. The next prime is 11313322351. The reversal of 11313322302 is 20322331311.
11313322302 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.
11313322302 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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, 942776853 + ... + 942776864.
It is an arithmetic number, because the mean of its divisors is an integer number (2828330577).
Almost surely, 211313322302 is an apocalyptic number.
11313322302 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.
11313322302 is a wasteful number, since it uses less digits than its factorization.
11313322302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1885553722.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 11313322302 its reverse (20322331311), we get a palindrome (31635653613).
Subtracting 11313322302 from its reverse (20322331311), we obtain a palindrome (9009009009).
The spelling of 11313322302 in words is "eleven billion, three hundred thirteen million, three hundred twenty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •