Base | Representation |
---|---|
bin | 1001101010100… |
… | …0011001001111 |
3 | 2211021102102200 |
4 | 2122220121033 |
5 | 40334120011 |
6 | 4004452543 |
7 | 1001355453 |
oct | 232503117 |
9 | 84242380 |
10 | 40535631 |
11 | 20977024 |
12 | 116aa153 |
13 | 85235a6 |
14 | 5552663 |
15 | 385a856 |
hex | 26a864f |
40535631 has 12 divisors (see below), whose sum is σ = 60440640. Its totient is φ = 26151840.
The previous prime is 40535629. The next prime is 40535639. The reversal of 40535631 is 13653504.
40535631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40535631 - 21 = 40535629 is a prime.
It is a super-2 number, since 2×405356312 = 3286274761136322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40535595 and 40535604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40535639) 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 11 ways as a sum of consecutive naturals, for example, 72366 + ... + 72923.
It is an arithmetic number, because the mean of its divisors is an integer number (5036720).
Almost surely, 240535631 is an apocalyptic number.
40535631 is a deficient number, since it is larger than the sum of its proper divisors (19905009).
40535631 is a wasteful number, since it uses less digits than its factorization.
40535631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145326 (or 145323 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 40535631 is about 6366.7598509760. The cubic root of 40535631 is about 343.5149526617.
The spelling of 40535631 in words is "forty million, five hundred thirty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •