Base | Representation |
---|---|
bin | 1001100100101… |
… | …0011001101101 |
3 | 2210112212022122 |
4 | 2121022121231 |
5 | 40234310022 |
6 | 3552322325 |
7 | 665163152 |
oct | 231123155 |
9 | 83485278 |
10 | 40150637 |
11 | 2073384a |
12 | 115433a5 |
13 | 841a297 |
14 | 5492229 |
15 | 37d1742 |
hex | 264a66d |
40150637 has 2 divisors, whose sum is σ = 40150638. Its totient is φ = 40150636.
The previous prime is 40150601. The next prime is 40150679. The reversal of 40150637 is 73605104.
40150637 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28665316 + 11485321 = 5354^2 + 3389^2 .
It is a cyclic number.
It is not a de Polignac number, because 40150637 - 218 = 39888493 is a prime.
It is a super-2 number, since 2×401506372 = 3224147303011538, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40150697) 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 as a sum of consecutive naturals, namely, 20075318 + 20075319.
It is an arithmetic number, because the mean of its divisors is an integer number (20075319).
Almost surely, 240150637 is an apocalyptic number.
It is an amenable number.
40150637 is a deficient number, since it is larger than the sum of its proper divisors (1).
40150637 is an equidigital number, since it uses as much as digits as its factorization.
40150637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 40150637 is about 6336.4530298898. The cubic root of 40150637 is about 342.4239609555.
The spelling of 40150637 in words is "forty million, one hundred fifty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •