Base | Representation |
---|---|
bin | 1110100110100011110010… |
… | …10101010000110111010100 |
3 | 11012200210122111212222001112 |
4 | 13103101321111100313110 |
5 | 13202102230021402012 |
6 | 152143404200314152 |
7 | 6522646514005112 |
oct | 723217125206724 |
9 | 135623574788045 |
10 | 32111211122132 |
11 | a2603195a4a2a |
12 | 372744b772958 |
13 | 14bc0c708a21c |
14 | 7d0295c06ab2 |
15 | 3aa446385122 |
hex | 1d3479550dd4 |
32111211122132 has 12 divisors (see below), whose sum is σ = 56251324434816. Its totient is φ = 16039404140760.
The previous prime is 32111211122129. The next prime is 32111211122141. The reversal of 32111211122132 is 23122111211123.
It is a super-2 number, since 2×321112111221322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32111211122098 and 32111211122107.
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, 4050350618 + ... + 4050358545.
It is an arithmetic number, because the mean of its divisors is an integer number (4687610369568).
Almost surely, 232111211122132 is an apocalyptic number.
It is an amenable number.
32111211122132 is a deficient number, since it is larger than the sum of its proper divisors (24140113312684).
32111211122132 is a wasteful number, since it uses less digits than its factorization.
32111211122132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8100710158 (or 8100710156 counting only the distinct ones).
The product of its digits is 288, while the sum is 23.
Adding to 32111211122132 its reverse (23122111211123), we get a palindrome (55233322333255).
The spelling of 32111211122132 in words is "thirty-two trillion, one hundred eleven billion, two hundred eleven million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •