Base | Representation |
---|---|
bin | 1001100100010… |
… | …0111110110001 |
3 | 2210111201212021 |
4 | 2121010332301 |
5 | 40233102213 |
6 | 3552031441 |
7 | 665041342 |
oct | 231047661 |
9 | 83451767 |
10 | 40128433 |
11 | 207190a4 |
12 | 11532581 |
13 | 8410147 |
14 | 54880c9 |
15 | 37c9d8d |
hex | 2644fb1 |
40128433 has 2 divisors, whose sum is σ = 40128434. Its totient is φ = 40128432.
The previous prime is 40128427. The next prime is 40128469. The reversal of 40128433 is 33482104.
40128433 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., 38340864 + 1787569 = 6192^2 + 1337^2 .
It is a cyclic number.
It is not a de Polignac number, because 40128433 - 29 = 40127921 is a prime.
It is a super-2 number, since 2×401284332 = 3220582270070978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40128398 and 40128407.
It is not a weakly prime, because it can be changed into another prime (40128493) 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, 20064216 + 20064217.
It is an arithmetic number, because the mean of its divisors is an integer number (20064217).
Almost surely, 240128433 is an apocalyptic number.
It is an amenable number.
40128433 is a deficient number, since it is larger than the sum of its proper divisors (1).
40128433 is an equidigital number, since it uses as much as digits as its factorization.
40128433 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 25.
The square root of 40128433 is about 6334.7007032693. The cubic root of 40128433 is about 342.3608271823.
The spelling of 40128433 in words is "forty million, one hundred twenty-eight thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •