Base | Representation |
---|---|
bin | 1101110010010… |
… | …00110100100000 |
3 | 22001121012111102 |
4 | 12321020310200 |
5 | 214101013012 |
6 | 15250333532 |
7 | 2602636421 |
oct | 671106440 |
9 | 261535442 |
10 | 115641632 |
11 | 5a3052a7 |
12 | 3288a2a8 |
13 | 1ac5c202 |
14 | 11503648 |
15 | a2442c2 |
hex | 6e48d20 |
115641632 has 18 divisors (see below), whose sum is σ = 227789289. Its totient is φ = 57790400.
The previous prime is 115641629. The next prime is 115641637. The reversal of 115641632 is 236146511.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 89794576 + 25847056 = 9476^2 + 5084^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=7604.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115641595 and 115641604.
It is not an unprimeable number, because it can be changed into a prime (115641637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 59882 + ... + 61782.
Almost surely, 2115641632 is an apocalyptic number.
It is an amenable number.
115641632 is a deficient number, since it is larger than the sum of its proper divisors (112147657).
115641632 is an frugal number, since it uses more digits than its factorization.
115641632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3812 (or 1903 counting only the distinct ones).
The product of its digits is 4320, while the sum is 29.
The square root of 115641632 is about 10753.6799282850. The cubic root of 115641632 is about 487.1971480353.
The spelling of 115641632 in words is "one hundred fifteen million, six hundred forty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •