Base | Representation |
---|---|
bin | 1101110010101… |
… | …00101010010100 |
3 | 22001200200000201 |
4 | 12321110222110 |
5 | 214104041012 |
6 | 15251350244 |
7 | 2603231005 |
oct | 671245224 |
9 | 261620021 |
10 | 115690132 |
11 | 5a338788 |
12 | 328b2384 |
13 | 1ac782cc |
14 | 115171ac |
15 | a253857 |
hex | 6e54a94 |
115690132 has 12 divisors (see below), whose sum is σ = 203577556. Its totient is φ = 57525120.
The previous prime is 115690111. The next prime is 115690139. The reversal of 115690132 is 231096511.
It can be written as a sum of positive squares in 2 ways, for example, as 857476 + 114832656 = 926^2 + 10716^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 115690132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115690139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79173 + ... + 80620.
Almost surely, 2115690132 is an apocalyptic number.
It is an amenable number.
115690132 is a deficient number, since it is larger than the sum of its proper divisors (87887424).
115690132 is a wasteful number, since it uses less digits than its factorization.
115690132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159978 (or 159976 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 28.
The square root of 115690132 is about 10755.9347339039. The cubic root of 115690132 is about 487.2652485360.
The spelling of 115690132 in words is "one hundred fifteen million, six hundred ninety thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •