Base | Representation |
---|---|
bin | 1001110011010… |
… | …1101000001101 |
3 | 2212100210222101 |
4 | 2130311220031 |
5 | 41011123000 |
6 | 4025115101 |
7 | 1006315153 |
oct | 234655015 |
9 | 85323871 |
10 | 41114125 |
11 | 21231718 |
12 | 11928a91 |
13 | 86969b0 |
14 | 56633d3 |
15 | 3921e6a |
hex | 2735a0d |
41114125 has 16 divisors (see below), whose sum is σ = 55259568. Its totient is φ = 30360000.
The previous prime is 41114123. The next prime is 41114131. The reversal of 41114125 is 52141114.
41114125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 18198756 + 22915369 = 4266^2 + 4787^2 .
It is not a de Polignac number, because 41114125 - 21 = 41114123 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41114123) 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 15 ways as a sum of consecutive naturals, for example, 11026 + ... + 14275.
It is an arithmetic number, because the mean of its divisors is an integer number (3453723).
Almost surely, 241114125 is an apocalyptic number.
It is an amenable number.
41114125 is a deficient number, since it is larger than the sum of its proper divisors (14145443).
41114125 is a wasteful number, since it uses less digits than its factorization.
41114125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25329 (or 25319 counting only the distinct ones).
The product of its digits is 160, while the sum is 19.
The square root of 41114125 is about 6412.0297098501. The cubic root of 41114125 is about 345.1413689351.
Adding to 41114125 its reverse (52141114), we get a palindrome (93255239).
The spelling of 41114125 in words is "forty-one million, one hundred fourteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •