Base | Representation |
---|---|
bin | 1001101010000… |
… | …0000101110101 |
3 | 2211012200210001 |
4 | 2122200011311 |
5 | 40332022441 |
6 | 4004031301 |
7 | 1001154346 |
oct | 232400565 |
9 | 84180701 |
10 | 40501621 |
11 | 20953516 |
12 | 11692531 |
13 | 8510c74 |
14 | 55440cd |
15 | 3850731 |
hex | 26a0175 |
40501621 has 4 divisors (see below), whose sum is σ = 41165644. Its totient is φ = 39837600.
The previous prime is 40501619. The next prime is 40501631. The reversal of 40501621 is 12610504.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6687396 + 33814225 = 2586^2 + 5815^2 .
It is a cyclic number.
It is not a de Polignac number, because 40501621 - 21 = 40501619 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40501631) 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 3 ways as a sum of consecutive naturals, for example, 331920 + ... + 332041.
It is an arithmetic number, because the mean of its divisors is an integer number (10291411).
Almost surely, 240501621 is an apocalyptic number.
It is an amenable number.
40501621 is a deficient number, since it is larger than the sum of its proper divisors (664023).
40501621 is an equidigital number, since it uses as much as digits as its factorization.
40501621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664022.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 40501621 is about 6364.0883871926. The cubic root of 40501621 is about 343.4188543883.
It can be divided in two parts, 4050 and 1621, that added together give a triangular number (5671 = T106).
The spelling of 40501621 in words is "forty million, five hundred one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •