Base | Representation |
---|---|
bin | 10011011000101110101… |
… | …100101010110010110001 |
3 | 11201100200221012212211011 |
4 | 103120232230222302301 |
5 | 133311343132321223 |
6 | 2500003121150521 |
7 | 165151510256401 |
oct | 23305654526261 |
9 | 4640627185734 |
10 | 1332223323313 |
11 | 473aa1375a03 |
12 | 19623aa8b441 |
13 | 98821c98b5c |
14 | 486a0dc2801 |
15 | 249c2d2680d |
hex | 1362eb2acb1 |
1332223323313 has 4 divisors (see below), whose sum is σ = 1332891776548. Its totient is φ = 1331554870080.
The previous prime is 1332223323253. The next prime is 1332223323317. The reversal of 1332223323313 is 3133233222331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1070628922944 + 261594400369 = 1034712^2 + 511463^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332223323313 - 213 = 1332223315121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1332223323317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 334223628 + ... + 334227613.
It is an arithmetic number, because the mean of its divisors is an integer number (333222944137).
Almost surely, 21332223323313 is an apocalyptic number.
It is an amenable number.
1332223323313 is a deficient number, since it is larger than the sum of its proper divisors (668453235).
1332223323313 is an equidigital number, since it uses as much as digits as its factorization.
1332223323313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668453234.
The product of its digits is 34992, while the sum is 31.
Adding to 1332223323313 its reverse (3133233222331), we get a palindrome (4465456545644).
The spelling of 1332223323313 in words is "one trillion, three hundred thirty-two billion, two hundred twenty-three million, three hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •