Base | Representation |
---|---|
bin | 1100111100100… |
… | …00111111111001 |
3 | 21120100022102001 |
4 | 12132100333321 |
5 | 210300102431 |
6 | 14435341001 |
7 | 2456030014 |
oct | 636207771 |
9 | 246308361 |
10 | 108597241 |
11 | 56333795 |
12 | 30451761 |
13 | 19663a2c |
14 | 105cc37b |
15 | 9801e61 |
hex | 6790ff9 |
108597241 has 9 divisors (see below), whose sum is σ = 115549581. Its totient is φ = 102042432.
The previous prime is 108597221. The next prime is 108597253. The reversal of 108597241 is 142795801.
The square root of 108597241 is 10421.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 19105641 + 89491600 = 4371^2 + 9460^2 .
It is not a de Polignac number, because 108597241 - 215 = 108564473 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 108597241.
It is not an unprimeable number, because it can be changed into a prime (108597211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 176851 + ... + 177463.
Almost surely, 2108597241 is an apocalyptic number.
108597241 is the 10421-st square number.
108597241 is the 5211-st centered octagonal number.
It is an amenable number.
108597241 is a deficient number, since it is larger than the sum of its proper divisors (6952340).
108597241 is an frugal number, since it uses more digits than its factorization.
108597241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1260 (or 630 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 37.
The cubic root of 108597241 is about 477.0965366512.
The spelling of 108597241 in words is "one hundred eight million, five hundred ninety-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •