Base | Representation |
---|---|
bin | 1100000111100000111001… |
… | …1110000110000001100011 |
3 | 1202011200120220021000000202 |
4 | 3001320032132012001203 |
5 | 3221241434204302321 |
6 | 44200335153335415 |
7 | 2543400043454306 |
oct | 301701636060143 |
9 | 52150526230022 |
10 | 13323231322211 |
11 | 4277394822238 |
12 | 15b216b26756b |
13 | 7584b5779215 |
14 | 340bc266cb3d |
15 | 18187b5ea70b |
hex | c1e0e786063 |
13323231322211 has 8 divisors (see below), whose sum is σ = 14024562313920. Its totient is φ = 12621911159592.
The previous prime is 13323231322207. The next prime is 13323231322229. The reversal of 13323231322211 is 11222313232331.
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 13323231322211 - 22 = 13323231322207 is a prime.
It is a Duffinian number.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (13323231322201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 118385 + ... + 5163378.
It is an arithmetic number, because the mean of its divisors is an integer number (1753070289240).
Almost surely, 213323231322211 is an apocalyptic number.
13323231322211 is a deficient number, since it is larger than the sum of its proper divisors (701330991709).
13323231322211 is a wasteful number, since it uses less digits than its factorization.
13323231322211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5414545.
The product of its digits is 7776, while the sum is 29.
Adding to 13323231322211 its reverse (11222313232331), we get a palindrome (24545544554542).
The spelling of 13323231322211 in words is "thirteen trillion, three hundred twenty-three billion, two hundred thirty-one million, three hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •