Base | Representation |
---|---|
bin | 111101101010001101… |
… | …0001110110101001001 |
3 | 110122210001210100000202 |
4 | 1323110122032311021 |
5 | 4132140120241121 |
6 | 140455102541545 |
7 | 12365211040400 |
oct | 1732432166511 |
9 | 418701710022 |
10 | 132412665161 |
11 | 51179552187 |
12 | 217b48978b5 |
13 | c6429a615a |
14 | 65a1aa4637 |
15 | 369ea8c40b |
hex | 1ed468ed49 |
132412665161 has 12 divisors (see below), whose sum is σ = 155394172692. Its totient is φ = 112492171008.
The previous prime is 132412665149. The next prime is 132412665163. The reversal of 132412665161 is 161566214231.
It can be written as a sum of positive squares in 2 ways, for example, as 71035575625 + 61377089536 = 266525^2 + 247744^2 .
It is not a de Polignac number, because 132412665161 - 26 = 132412665097 is a prime.
It is a super-2 number, since 2×1324126651612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132412665163) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11951540 + ... + 11962613.
It is an arithmetic number, because the mean of its divisors is an integer number (12949514391).
Almost surely, 2132412665161 is an apocalyptic number.
It is an amenable number.
132412665161 is a deficient number, since it is larger than the sum of its proper divisors (22981507531).
132412665161 is a wasteful number, since it uses less digits than its factorization.
132412665161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23914280 (or 23914273 counting only the distinct ones).
The product of its digits is 51840, while the sum is 38.
Adding to 132412665161 its reverse (161566214231), we get a palindrome (293978879392).
The spelling of 132412665161 in words is "one hundred thirty-two billion, four hundred twelve million, six hundred sixty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •