Base | Representation |
---|---|
bin | 110000010100111011110… |
… | …100011011101000010101 |
3 | 102202111010010110120110020 |
4 | 300110323310123220111 |
5 | 413402413402221323 |
6 | 11021352533015353 |
7 | 461635543312611 |
oct | 60247364335025 |
9 | 12674103416406 |
10 | 3321013320213 |
11 | 1070485493516 |
12 | 457774784559 |
13 | 1b1229c584a4 |
14 | b6a48b38341 |
15 | 5b5c1ad1ae3 |
hex | 3053bd1ba15 |
3321013320213 has 16 divisors (see below), whose sum is σ = 4588108276800. Its totient is φ = 2134210296960.
The previous prime is 3321013320197. The next prime is 3321013320239. The reversal of 3321013320213 is 3120233101233.
3321013320213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3321013320213 - 24 = 3321013320197 is a prime.
It is a super-2 number, since 2×33210133202132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3321013320283) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30780208 + ... + 30887913.
It is an arithmetic number, because the mean of its divisors is an integer number (286756767300).
Almost surely, 23321013320213 is an apocalyptic number.
It is an amenable number.
3321013320213 is a deficient number, since it is larger than the sum of its proper divisors (1267094956587).
3321013320213 is a wasteful number, since it uses less digits than its factorization.
3321013320213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61668772.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 3321013320213 its reverse (3120233101233), we get a palindrome (6441246421446).
The spelling of 3321013320213 in words is "three trillion, three hundred twenty-one billion, thirteen million, three hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •