Base | Representation |
---|---|
bin | 1111101111111… |
… | …11000011110001 |
3 | 100012121020001220 |
4 | 13313333003301 |
5 | 232310213341 |
6 | 21035415253 |
7 | 3162654642 |
oct | 767770361 |
9 | 305536056 |
10 | 132116721 |
11 | 68638280 |
12 | 382b4529 |
13 | 214aa099 |
14 | 137916c9 |
15 | b8eaa66 |
hex | 7dff0f1 |
132116721 has 16 divisors (see below), whose sum is σ = 198797760. Its totient is φ = 77309120.
The previous prime is 132116717. The next prime is 132116723. The reversal of 132116721 is 127611231.
It is a cyclic number.
It is not a de Polignac number, because 132116721 - 22 = 132116717 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132116691 and 132116700.
It is not an unprimeable number, because it can be changed into a prime (132116723) 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 15 ways as a sum of consecutive naturals, for example, 68070 + ... + 69983.
It is an arithmetic number, because the mean of its divisors is an integer number (12424860).
Almost surely, 2132116721 is an apocalyptic number.
132116721 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132116721 is a deficient number, since it is larger than the sum of its proper divisors (66681039).
132116721 is a wasteful number, since it uses less digits than its factorization.
132116721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138096.
The product of its digits is 504, while the sum is 24.
The square root of 132116721 is about 11494.2038001769. The cubic root of 132116721 is about 509.3143689410.
Adding to 132116721 its reverse (127611231), we get a palindrome (259727952).
The spelling of 132116721 in words is "one hundred thirty-two million, one hundred sixteen thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •