Base | Representation |
---|---|
bin | 1111001001110011000101… |
… | …01100001000110110010001 |
3 | 11100222112221022101112122112 |
4 | 13210321202230020312101 |
5 | 13331421440034120423 |
6 | 154511530533515105 |
7 | 10006302343556465 |
oct | 744714254106621 |
9 | 140875838345575 |
10 | 33322012020113 |
11 | a68787109a593 |
12 | 38a20424a2a95 |
13 | 157933826ac0b |
14 | 832b189b44a5 |
15 | 3cbbae3d1a78 |
hex | 1e4e62b08d91 |
33322012020113 has 8 divisors (see below), whose sum is σ = 33870809064000. Its totient is φ = 32773296736080.
The previous prime is 33322012020109. The next prime is 33322012020119. The reversal of 33322012020113 is 31102021022333.
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 33322012020113 - 22 = 33322012020109 is a prime.
It is a super-2 number, since 2×333220120201132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33322012020119) 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, 19617863 + ... + 21248636.
It is an arithmetic number, because the mean of its divisors is an integer number (4233851133000).
Almost surely, 233322012020113 is an apocalyptic number.
It is an amenable number.
33322012020113 is a deficient number, since it is larger than the sum of its proper divisors (548797043887).
33322012020113 is a wasteful number, since it uses less digits than its factorization.
33322012020113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40879927.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 33322012020113 its reverse (31102021022333), we get a palindrome (64424033042446).
The spelling of 33322012020113 in words is "thirty-three trillion, three hundred twenty-two billion, twelve million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •