Base | Representation |
---|---|
bin | 1110100111001100100111… |
… | …11011100011000000100110 |
3 | 11012202220020020021012111022 |
4 | 13103212103323203000212 |
5 | 13202432123320431042 |
6 | 152201431313211142 |
7 | 6524353654056035 |
oct | 723462373430046 |
9 | 135686206235438 |
10 | 32133132202022 |
11 | a269648467785 |
12 | 372b748b60ab2 |
13 | 14c11ab769507 |
14 | 7d13752c271c |
15 | 3aaccaac4cd2 |
hex | 1d3993ee3026 |
32133132202022 has 8 divisors (see below), whose sum is σ = 48217477617072. Its totient is φ = 16060639663000.
The previous prime is 32133132202013. The next prime is 32133132202123. The reversal of 32133132202022 is 22020223133123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×321331322020222 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32133132201982 and 32133132202000.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2963212229 + ... + 2963223072.
It is an arithmetic number, because the mean of its divisors is an integer number (6027184702134).
Almost surely, 232133132202022 is an apocalyptic number.
32133132202022 is a deficient number, since it is larger than the sum of its proper divisors (16084345415050).
32133132202022 is a wasteful number, since it uses less digits than its factorization.
32133132202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5926438014.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 32133132202022 its reverse (22020223133123), we get a palindrome (54153355335145).
The spelling of 32133132202022 in words is "thirty-two trillion, one hundred thirty-three billion, one hundred thirty-two million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •