Base | Representation |
---|---|
bin | 1001100011001… |
… | …1101000110101 |
3 | 2210101010102022 |
4 | 2120303220311 |
5 | 40223314042 |
6 | 3550322525 |
7 | 664324262 |
oct | 230635065 |
9 | 83333368 |
10 | 40057397 |
11 | 2067a796 |
12 | 114b9445 |
13 | 83b6a03 |
14 | 546a269 |
15 | 37b3cd2 |
hex | 2633a35 |
40057397 has 2 divisors, whose sum is σ = 40057398. Its totient is φ = 40057396.
The previous prime is 40057379. The next prime is 40057417. The reversal of 40057397 is 79375004.
40057397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (40057379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40056241 + 1156 = 6329^2 + 34^2 .
It is a cyclic number.
It is not a de Polignac number, because 40057397 - 28 = 40057141 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40057327) 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, 20028698 + 20028699.
It is an arithmetic number, because the mean of its divisors is an integer number (20028699).
Almost surely, 240057397 is an apocalyptic number.
It is an amenable number.
40057397 is a deficient number, since it is larger than the sum of its proper divisors (1).
40057397 is an equidigital number, since it uses as much as digits as its factorization.
40057397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 35.
The square root of 40057397 is about 6329.0913249850. The cubic root of 40057397 is about 342.1586903054.
The spelling of 40057397 in words is "forty million, fifty-seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •