Base | Representation |
---|---|
bin | 1001100101100… |
… | …1011101000011 |
3 | 2210122222220010 |
4 | 2121121131003 |
5 | 40243243131 |
6 | 3553520003 |
7 | 665541000 |
oct | 231313503 |
9 | 83588803 |
10 | 40212291 |
11 | 207760a9 |
12 | 11573003 |
13 | 843c372 |
14 | 54aa8a7 |
15 | 37e4b46 |
hex | 2659743 |
40212291 has 16 divisors (see below), whose sum is σ = 62528000. Its totient is φ = 22977864.
The previous prime is 40212281. The next prime is 40212313. The reversal of 40212291 is 19221204.
40212291 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 40212291 - 214 = 40195907 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a nialpdrome in base 7.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40212251) 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 15 ways as a sum of consecutive naturals, for example, 18511 + ... + 20568.
It is an arithmetic number, because the mean of its divisors is an integer number (3908000).
Almost surely, 240212291 is an apocalyptic number.
40212291 is a deficient number, since it is larger than the sum of its proper divisors (22315709).
40212291 is an equidigital number, since it uses as much as digits as its factorization.
40212291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39103 (or 39089 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 40212291 is about 6341.3161883003. The cubic root of 40212291 is about 342.5991429823.
Adding to 40212291 its reverse (19221204), we get a palindrome (59433495).
The spelling of 40212291 in words is "forty million, two hundred twelve thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •