Base | Representation |
---|---|
bin | 11110000010011110001111… |
… | …111001010001001101001000 |
3 | 122022202201101120022012122001 |
4 | 132002132033321101031020 |
5 | 114304002432140242412 |
6 | 1144551033251240344 |
7 | 36553504332666214 |
oct | 3602361771211510 |
9 | 568681346265561 |
10 | 132111313212232 |
11 | 3910510319a992 |
12 | 129980835a90b4 |
13 | 58940743c90c3 |
14 | 248a3163d1944 |
15 | 10417b9abd957 |
hex | 78278fe51348 |
132111313212232 has 32 divisors (see below), whose sum is σ = 248822821987200. Its totient is φ = 65758733287744.
The previous prime is 132111313212227. The next prime is 132111313212233. The reversal of 132111313212232 is 232212313111231.
It is a self number, because there is not a number n which added to its sum of digits gives 132111313212232.
It is not an unprimeable number, because it can be changed into a prime (132111313212233) 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 7 ways as a sum of consecutive naturals, for example, 4661983 + ... + 16910254.
It is an arithmetic number, because the mean of its divisors is an integer number (7775713187100).
Almost surely, 2132111313212232 is an apocalyptic number.
It is an amenable number.
132111313212232 is a deficient number, since it is larger than the sum of its proper divisors (116711508774968).
132111313212232 is a wasteful number, since it uses less digits than its factorization.
132111313212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21575685 (or 21575681 counting only the distinct ones).
The product of its digits is 2592, while the sum is 28.
Adding to 132111313212232 its reverse (232212313111231), we get a palindrome (364323626323463).
The spelling of 132111313212232 in words is "one hundred thirty-two trillion, one hundred eleven billion, three hundred thirteen million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •