Base | Representation |
---|---|
bin | 1001101000101… |
… | …0001111100011 |
3 | 2211001011000121 |
4 | 2122022033203 |
5 | 40321142011 |
6 | 4002101111 |
7 | 1000332424 |
oct | 232121743 |
9 | 84034017 |
10 | 40412131 |
11 | 208a2261 |
12 | 1164a797 |
13 | 84ac306 |
14 | 551d64b |
15 | 3833e71 |
hex | 268a3e3 |
40412131 has 8 divisors (see below), whose sum is σ = 41469120. Its totient is φ = 39360552.
The previous prime is 40412093. The next prime is 40412137. The reversal of 40412131 is 13121404.
40412131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40412131 - 221 = 38314979 is a prime.
It is a super-2 number, since 2×404121312 = 3266280663922322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40412137) 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 in 7 ways as a sum of consecutive naturals, for example, 16896 + ... + 19138.
It is an arithmetic number, because the mean of its divisors is an integer number (5183640).
Almost surely, 240412131 is an apocalyptic number.
40412131 is a deficient number, since it is larger than the sum of its proper divisors (1056989).
40412131 is a wasteful number, since it uses less digits than its factorization.
40412131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2705.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 40412131 is about 6357.0536414286. The cubic root of 40412131 is about 343.1657351691.
Adding to 40412131 its reverse (13121404), we get a palindrome (53533535).
The spelling of 40412131 in words is "forty million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •