Base | Representation |
---|---|
bin | 1001100101100… |
… | …1001010011101 |
3 | 2210122221021001 |
4 | 2121121022131 |
5 | 40243223401 |
6 | 3553510301 |
7 | 665534350 |
oct | 231311235 |
9 | 83587231 |
10 | 40211101 |
11 | 20775217 |
12 | 11572391 |
13 | 843b968 |
14 | 54aa297 |
15 | 37e4601 |
hex | 265929d |
40211101 has 8 divisors (see below), whose sum is σ = 46585664. Its totient is φ = 33994080.
The previous prime is 40211099. The next prime is 40211111. The reversal of 40211101 is 10111204.
40211101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40211101 - 21 = 40211099 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 (40211111) 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 7 ways as a sum of consecutive naturals, for example, 38835 + ... + 39856.
It is an arithmetic number, because the mean of its divisors is an integer number (5823208).
Almost surely, 240211101 is an apocalyptic number.
It is an amenable number.
40211101 is a deficient number, since it is larger than the sum of its proper divisors (6374563).
40211101 is an equidigital number, since it uses as much as digits as its factorization.
40211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78771.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 40211101 is about 6341.2223585047. Note that the first 3 decimals coincide. The cubic root of 40211101 is about 342.5957634434.
Adding to 40211101 its reverse (10111204), we get a palindrome (50322305).
The spelling of 40211101 in words is "forty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •