Base | Representation |
---|---|
bin | 1010010011000110101010… |
… | …0010011011100101001101 |
3 | 1111002111110201112120100120 |
4 | 2210301222202123211031 |
5 | 2441010130211444041 |
6 | 40025510103015153 |
7 | 2246040312104352 |
oct | 244615242334515 |
9 | 44074421476316 |
10 | 11323321203021 |
11 | 3676214691213 |
12 | 132a65143a4b9 |
13 | 641a27a24779 |
14 | 2b20a1ad8629 |
15 | 14982b474366 |
hex | a4c6a89b94d |
11323321203021 has 8 divisors (see below), whose sum is σ = 15108152361120. Its totient is φ = 7543685423472.
The previous prime is 11323321203001. The next prime is 11323321203049. The reversal of 11323321203021 is 12030212332311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11323321203021 - 223 = 11323312814413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11323321202982 and 11323321203000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11323321203001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1298839551 + ... + 1298848268.
It is an arithmetic number, because the mean of its divisors is an integer number (1888519045140).
Almost surely, 211323321203021 is an apocalyptic number.
It is an amenable number.
11323321203021 is a deficient number, since it is larger than the sum of its proper divisors (3784831158099).
11323321203021 is a wasteful number, since it uses less digits than its factorization.
11323321203021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2597689275.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11323321203021 its reverse (12030212332311), we get a palindrome (23353533535332).
The spelling of 11323321203021 in words is "eleven trillion, three hundred twenty-three billion, three hundred twenty-one million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •