Base | Representation |
---|---|
bin | 1111110100011… |
… | …10010111000001 |
3 | 100020201001020011 |
4 | 13322032113001 |
5 | 232433004211 |
6 | 21100144521 |
7 | 3200651125 |
oct | 772162701 |
9 | 306631204 |
10 | 132703681 |
11 | 689a9270 |
12 | 38538141 |
13 | 216542b6 |
14 | 138a5585 |
15 | b9b4921 |
hex | 7e8e5c1 |
132703681 has 8 divisors (see below), whose sum is σ = 149760000. Its totient is φ = 116479440.
The previous prime is 132703667. The next prime is 132703687. The reversal of 132703681 is 186307231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-132703681 is a prime.
It is a super-2 number, since 2×1327036812 = 35220533901899522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132703687) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207681 + ... + 208318.
It is an arithmetic number, because the mean of its divisors is an integer number (18720000).
Almost surely, 2132703681 is an apocalyptic number.
132703681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132703681 is a deficient number, since it is larger than the sum of its proper divisors (17056319).
132703681 is a wasteful number, since it uses less digits than its factorization.
132703681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416039.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 132703681 is about 11519.7083730449. The cubic root of 132703681 is about 510.0675048413.
The spelling of 132703681 in words is "one hundred thirty-two million, seven hundred three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •