Base | Representation |
---|---|
bin | 100110001110001011… |
… | …100100111010100101 |
3 | 10220221011012100111112 |
4 | 212032023210322211 |
5 | 1133022231331000 |
6 | 30504211514405 |
7 | 2652004065155 |
oct | 461613447245 |
9 | 126834170445 |
10 | 41040105125 |
11 | 16450084458 |
12 | 7b542b8a05 |
13 | 3b406c2096 |
14 | 1db4798765 |
15 | 1102e8b235 |
hex | 98e2e4ea5 |
41040105125 has 32 divisors (see below), whose sum is σ = 51523396704. Its totient is φ = 32636928000.
The previous prime is 41040105091. The next prime is 41040105143. The reversal of 41040105125 is 52150104014.
41040105125 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 16 ways, for example, as 3899877601 + 37140227524 = 62449^2 + 192718^2 .
It is not a de Polignac number, because 41040105125 - 222 = 41035910821 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41040105125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20591129 + ... + 20593121.
It is an arithmetic number, because the mean of its divisors is an integer number (1610106147).
Almost surely, 241040105125 is an apocalyptic number.
It is an amenable number.
41040105125 is a deficient number, since it is larger than the sum of its proper divisors (10483291579).
41040105125 is a wasteful number, since it uses less digits than its factorization.
41040105125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2906 (or 2896 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 23.
Adding to 41040105125 its reverse (52150104014), we get a palindrome (93190209139).
The spelling of 41040105125 in words is "forty-one billion, forty million, one hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •