Base | Representation |
---|---|
bin | 1001011100100… |
… | …1001001101101 |
3 | 2202112222002221 |
4 | 2113021021231 |
5 | 40120334404 |
6 | 3533115341 |
7 | 660526534 |
oct | 227111155 |
9 | 82488087 |
10 | 39621229 |
11 | 2040201a |
12 | 11328b51 |
13 | 829331b |
14 | 539531b |
15 | 3729954 |
hex | 25c926d |
39621229 has 2 divisors, whose sum is σ = 39621230. Its totient is φ = 39621228.
The previous prime is 39621227. The next prime is 39621259. The reversal of 39621229 is 92212693.
39621229 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., 21114025 + 18507204 = 4595^2 + 4302^2 .
It is a cyclic number.
It is not a de Polignac number, because 39621229 - 21 = 39621227 is a prime.
Together with 39621227, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 39621194 and 39621203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (39621223) 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, 19810614 + 19810615.
It is an arithmetic number, because the mean of its divisors is an integer number (19810615).
Almost surely, 239621229 is an apocalyptic number.
It is an amenable number.
39621229 is a deficient number, since it is larger than the sum of its proper divisors (1).
39621229 is an equidigital number, since it uses as much as digits as its factorization.
39621229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11664, while the sum is 34.
The square root of 39621229 is about 6294.5396177957. The cubic root of 39621229 is about 340.9122818266.
The spelling of 39621229 in words is "thirty-nine million, six hundred twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •