Base | Representation |
---|---|
bin | 1111101111001… |
… | …11011100101011 |
3 | 100012102022102001 |
4 | 13313213130223 |
5 | 232244120021 |
6 | 21033351431 |
7 | 3162102664 |
oct | 767473453 |
9 | 305368361 |
10 | 132020011 |
11 | 68581652 |
12 | 38268577 |
13 | 21475066 |
14 | 1376836b |
15 | b8cc091 |
hex | 7de772b |
132020011 has 4 divisors (see below), whose sum is σ = 139785912. Its totient is φ = 124254112.
The previous prime is 132019997. The next prime is 132020071. The reversal of 132020011 is 110020231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110020231 = 67 ⋅1642093.
It is a cyclic number.
It is not a de Polignac number, because 132020011 - 219 = 131495723 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132020011.
It is not an unprimeable number, because it can be changed into a prime (132020071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3882925 + ... + 3882958.
It is an arithmetic number, because the mean of its divisors is an integer number (34946478).
Almost surely, 2132020011 is an apocalyptic number.
132020011 is a deficient number, since it is larger than the sum of its proper divisors (7765901).
132020011 is an equidigital number, since it uses as much as digits as its factorization.
132020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7765900.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 132020011 is about 11489.9961270664. The cubic root of 132020011 is about 509.1900651799.
Adding to 132020011 its reverse (110020231), we get a palindrome (242040242).
The spelling of 132020011 in words is "one hundred thirty-two million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •