Base | Representation |
---|---|
bin | 111101100101110101… |
… | …1010110000101111011 |
3 | 110122101212002220210202 |
4 | 1323023223112011323 |
5 | 4131340114001121 |
6 | 140432350432415 |
7 | 12361451531234 |
oct | 1731353260573 |
9 | 418355086722 |
10 | 132266156411 |
11 | 51103884a74 |
12 | 2177380270b |
13 | c61b52a39c |
14 | 658a44808b |
15 | 3691c9c40b |
hex | 1ecbad617b |
132266156411 has 4 divisors (see below), whose sum is σ = 132397243800. Its totient is φ = 132135069024.
The previous prime is 132266156383. The next prime is 132266156459. The reversal of 132266156411 is 114651662231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 114651662231 = 3209 ⋅35728159.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132266156411 is a prime.
It is a super-2 number, since 2×1322661564112 (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 (132266156611) 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 3 ways as a sum of consecutive naturals, for example, 65542181 + ... + 65544198.
It is an arithmetic number, because the mean of its divisors is an integer number (33099310950).
Almost surely, 2132266156411 is an apocalyptic number.
132266156411 is a deficient number, since it is larger than the sum of its proper divisors (131087389).
132266156411 is a wasteful number, since it uses less digits than its factorization.
132266156411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131087388.
The product of its digits is 51840, while the sum is 38.
The spelling of 132266156411 in words is "one hundred thirty-two billion, two hundred sixty-six million, one hundred fifty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •