Base | Representation |
---|---|
bin | 1001110001110… |
… | …1001000000101 |
3 | 2212011201022100 |
4 | 2130131020011 |
5 | 40444420030 |
6 | 4023022313 |
7 | 1005416442 |
oct | 234351005 |
9 | 85151270 |
10 | 41013765 |
11 | 21173281 |
12 | 1189a999 |
13 | 8660100 |
14 | 56389c9 |
15 | 3902360 |
hex | 271d205 |
41013765 has 36 divisors (see below), whose sum is σ = 76993956. Its totient is φ = 20187648.
The previous prime is 41013727. The next prime is 41013767. The reversal of 41013765 is 56731014.
It can be written as a sum of positive squares in 6 ways, for example, as 1285956 + 39727809 = 1134^2 + 6303^2 .
It is not a de Polignac number, because 41013765 - 28 = 41013509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41013767) 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 35 ways as a sum of consecutive naturals, for example, 4909 + ... + 10301.
It is an arithmetic number, because the mean of its divisors is an integer number (2138721).
Almost surely, 241013765 is an apocalyptic number.
41013765 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
41013765 is a deficient number, since it is larger than the sum of its proper divisors (35980191).
41013765 is a wasteful number, since it uses less digits than its factorization.
41013765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5430 (or 5414 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 41013765 is about 6404.1990131475. The cubic root of 41013765 is about 344.8603089159.
Adding to 41013765 its reverse (56731014), we get a palindrome (97744779).
The spelling of 41013765 in words is "forty-one million, thirteen thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •