Base | Representation |
---|---|
bin | 1111110011000… |
… | …00110011101010 |
3 | 100020100120021200 |
4 | 13321200303222 |
5 | 232411021343 |
6 | 21052145030 |
7 | 3166243140 |
oct | 771406352 |
9 | 306316250 |
10 | 132517098 |
11 | 6889106a |
12 | 38468176 |
13 | 215ba3ac |
14 | 13857590 |
15 | b9794d3 |
hex | 7e60cea |
132517098 has 48 divisors (see below), whose sum is σ = 332781696. Its totient is φ = 37326240.
The previous prime is 132517097. The next prime is 132517123. The reversal of 132517098 is 890715231.
132517098 is a `hidden beast` number, since 132 + 517 + 0 + 9 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (132517093) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1540 + ... + 16352.
It is an arithmetic number, because the mean of its divisors is an integer number (6932952).
Almost surely, 2132517098 is an apocalyptic number.
132517098 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 132517098, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166390848).
132517098 is an abundant number, since it is smaller than the sum of its proper divisors (200264598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132517098 is a wasteful number, since it uses less digits than its factorization.
132517098 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14899 (or 14896 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 132517098 is about 11511.6070989241. The cubic root of 132517098 is about 509.8283389975.
The spelling of 132517098 in words is "one hundred thirty-two million, five hundred seventeen thousand, ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •