Base | Representation |
---|---|
bin | 110000010101110110110… |
… | …001001101110111001101 |
3 | 102202120200001110122010101 |
4 | 300111312301031313031 |
5 | 413411430044130013 |
6 | 11022035023011101 |
7 | 462002212633321 |
oct | 60256661156715 |
9 | 12676601418111 |
10 | 3322002333133 |
11 | 1070942792570 |
12 | 4579aba39a91 |
13 | 1b1356b19733 |
14 | b6b00225981 |
15 | 5b62d8428dd |
hex | 30576c4ddcd |
3322002333133 has 32 divisors (see below), whose sum is σ = 3846548321280. Its totient is φ = 2835423548160.
The previous prime is 3322002333131. The next prime is 3322002333151. The reversal of 3322002333133 is 3313332002233.
It is not a de Polignac number, because 3322002333133 - 21 = 3322002333131 is a prime.
It is a super-2 number, since 2×33220023331332 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3322002333131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 129737710 + ... + 129763312.
It is an arithmetic number, because the mean of its divisors is an integer number (120204635040).
Almost surely, 23322002333133 is an apocalyptic number.
It is an amenable number.
3322002333133 is a deficient number, since it is larger than the sum of its proper divisors (524545988147).
3322002333133 is a wasteful number, since it uses less digits than its factorization.
3322002333133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27297.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 3322002333133 its reverse (3313332002233), we get a palindrome (6635334335366).
The spelling of 3322002333133 in words is "three trillion, three hundred twenty-two billion, two million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •