Base | Representation |
---|---|
bin | 1010000010111… |
… | …0001000111111 |
3 | 2221021112021121 |
4 | 2200232020333 |
5 | 41241211111 |
6 | 4103011411 |
7 | 1021054624 |
oct | 240561077 |
9 | 87245247 |
10 | 42132031 |
11 | 21867467 |
12 | 12139b67 |
13 | 89620c6 |
14 | 584a34b |
15 | 3a73871 |
hex | 282e23f |
42132031 has 2 divisors, whose sum is σ = 42132032. Its totient is φ = 42132030.
The previous prime is 42132017. The next prime is 42132053. The reversal of 42132031 is 13023124.
It is a happy number.
42132031 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 is a cyclic number.
It is not a de Polignac number, because 42132031 - 213 = 42123839 is a prime.
It is a super-2 number, since 2×421320312 = 3550216072369922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42131996 and 42132014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42132091) 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, 21066015 + 21066016.
It is an arithmetic number, because the mean of its divisors is an integer number (21066016).
Almost surely, 242132031 is an apocalyptic number.
42132031 is a deficient number, since it is larger than the sum of its proper divisors (1).
42132031 is an equidigital number, since it uses as much as digits as its factorization.
42132031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 42132031 is about 6490.9191182759. The cubic root of 42132031 is about 347.9665241723.
Adding to 42132031 its reverse (13023124), we get a palindrome (55155155).
The spelling of 42132031 in words is "forty-two million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •