Base | Representation |
---|---|
bin | 1001101010010… |
… | …1011100001011 |
3 | 2211020210211112 |
4 | 2122211130023 |
5 | 40333223111 |
6 | 4004320535 |
7 | 1001305256 |
oct | 232453413 |
9 | 84223745 |
10 | 40523531 |
11 | 20968a24 |
12 | 116a314b |
13 | 851ac29 |
14 | 554c09d |
15 | 3856e8b |
hex | 26a570b |
40523531 has 2 divisors, whose sum is σ = 40523532. Its totient is φ = 40523530.
The previous prime is 40523521. The next prime is 40523533. The reversal of 40523531 is 13532504.
40523531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40523531 is a prime.
It is a super-2 number, since 2×405235312 = 3284313129415922, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 40523533, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 40523497 and 40523506.
It is not a weakly prime, because it can be changed into another prime (40523533) 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, 20261765 + 20261766.
It is an arithmetic number, because the mean of its divisors is an integer number (20261766).
Almost surely, 240523531 is an apocalyptic number.
40523531 is a deficient number, since it is larger than the sum of its proper divisors (1).
40523531 is an equidigital number, since it uses as much as digits as its factorization.
40523531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 40523531 is about 6365.8095321805. The cubic root of 40523531 is about 343.4807692000.
The spelling of 40523531 in words is "forty million, five hundred twenty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •