Base | Representation |
---|---|
bin | 1001101111000… |
… | …0000100100101 |
3 | 2211211100011101 |
4 | 2123300010211 |
5 | 40423013341 |
6 | 4015040101 |
7 | 1004020426 |
oct | 233600445 |
9 | 84740141 |
10 | 40829221 |
11 | 21057664 |
12 | 11810031 |
13 | 85c7104 |
14 | 55cb64d |
15 | 38b7831 |
hex | 26f0125 |
40829221 has 2 divisors, whose sum is σ = 40829222. Its totient is φ = 40829220.
The previous prime is 40829219. The next prime is 40829227. The reversal of 40829221 is 12292804.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25704900 + 15124321 = 5070^2 + 3889^2 .
It is a cyclic number.
It is not a de Polignac number, because 40829221 - 21 = 40829219 is a prime.
Together with 40829219, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 40829221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40829227) 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 as a sum of consecutive naturals, namely, 20414610 + 20414611.
It is an arithmetic number, because the mean of its divisors is an integer number (20414611).
Almost surely, 240829221 is an apocalyptic number.
It is an amenable number.
40829221 is a deficient number, since it is larger than the sum of its proper divisors (1).
40829221 is an equidigital number, since it uses as much as digits as its factorization.
40829221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 40829221 is about 6389.7747221635. The cubic root of 40829221 is about 344.3422910119.
It can be divided in two parts, 40829 and 221, that multiplied together give a palindrome (9023209).
The spelling of 40829221 in words is "forty million, eight hundred twenty-nine thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •