Base | Representation |
---|---|
bin | 1001001000110… |
… | …0110010111101 |
3 | 2200010010121122 |
4 | 2102030302331 |
5 | 34302403222 |
6 | 3445240325 |
7 | 643521653 |
oct | 222146275 |
9 | 80103548 |
10 | 38325437 |
11 | 1a6a7517 |
12 | 10a030a5 |
13 | 7c2b597 |
14 | 5138dd3 |
15 | 3570a42 |
hex | 248ccbd |
38325437 has 2 divisors, whose sum is σ = 38325438. Its totient is φ = 38325436.
The previous prime is 38325433. The next prime is 38325457. The reversal of 38325437 is 73452383.
38325437 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., 35832196 + 2493241 = 5986^2 + 1579^2 .
It is a cyclic number.
It is not a de Polignac number, because 38325437 - 22 = 38325433 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 38325397 and 38325406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (38325431) 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, 19162718 + 19162719.
It is an arithmetic number, because the mean of its divisors is an integer number (19162719).
Almost surely, 238325437 is an apocalyptic number.
It is an amenable number.
38325437 is a deficient number, since it is larger than the sum of its proper divisors (1).
38325437 is an equidigital number, since it uses as much as digits as its factorization.
38325437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 60480, while the sum is 35.
The square root of 38325437 is about 6190.7541543822. The cubic root of 38325437 is about 337.1545605009.
The spelling of 38325437 in words is "thirty-eight million, three hundred twenty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •