Base | Representation |
---|---|
bin | 1101110000000… |
… | …10100110111001 |
3 | 22001001120222220 |
4 | 12320002212321 |
5 | 214012312131 |
6 | 15240234253 |
7 | 2600331105 |
oct | 670024671 |
9 | 261046886 |
10 | 115354041 |
11 | 5a129220 |
12 | 3276b989 |
13 | 1ab8b33a |
14 | 1146a905 |
15 | a1d8e96 |
hex | 6e029b9 |
115354041 has 8 divisors (see below), whose sum is σ = 167787744. Its totient is φ = 69911520.
The previous prime is 115354021. The next prime is 115354051. The reversal of 115354041 is 140453511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115354041 - 29 = 115353529 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (115354021) 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 7 ways as a sum of consecutive naturals, for example, 1747756 + ... + 1747821.
It is an arithmetic number, because the mean of its divisors is an integer number (20973468).
Almost surely, 2115354041 is an apocalyptic number.
115354041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
115354041 is a deficient number, since it is larger than the sum of its proper divisors (52433703).
115354041 is a wasteful number, since it uses less digits than its factorization.
115354041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3495591.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 115354041 is about 10740.2998561493. The cubic root of 115354041 is about 486.7929400135.
It can be divided in two parts, 11535 and 4041, that added together give a triangular number (15576 = T176).
The spelling of 115354041 in words is "one hundred fifteen million, three hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •