Base | Representation |
---|---|
bin | 1101101101101… |
… | …10110100111001 |
3 | 22000110211012121 |
4 | 12312312310321 |
5 | 213422344031 |
6 | 15225441241 |
7 | 2564566126 |
oct | 666666471 |
9 | 260424177 |
10 | 115043641 |
11 | 59a36a99 |
12 | 32640221 |
13 | 1aaacc7b |
14 | 113c974d |
15 | a177011 |
hex | 6db6d39 |
115043641 has 4 divisors (see below), whose sum is σ = 121810932. Its totient is φ = 108276352.
The previous prime is 115043603. The next prime is 115043659. The reversal of 115043641 is 146340511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 146340511 = 1223 ⋅119657.
It can be written as a sum of positive squares in 2 ways, for example, as 61168041 + 53875600 = 7821^2 + 7340^2 .
It is a cyclic number.
It is not a de Polignac number, because 115043641 - 29 = 115043129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115043681) 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 3 ways as a sum of consecutive naturals, for example, 3383620 + ... + 3383653.
It is an arithmetic number, because the mean of its divisors is an integer number (30452733).
Almost surely, 2115043641 is an apocalyptic number.
It is an amenable number.
115043641 is a deficient number, since it is larger than the sum of its proper divisors (6767291).
115043641 is an equidigital number, since it uses as much as digits as its factorization.
115043641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6767290.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 115043641 is about 10725.8398738747. The cubic root of 115043641 is about 486.3559194587.
The spelling of 115043641 in words is "one hundred fifteen million, forty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •