Base | Representation |
---|---|
bin | 1001100010100… |
… | …0001010111111 |
3 | 2210021201222211 |
4 | 2120220022333 |
5 | 40220313211 |
6 | 3545321251 |
7 | 664040326 |
oct | 230501277 |
9 | 83251884 |
10 | 40010431 |
11 | 2064847a |
12 | 11496227 |
13 | 839b516 |
14 | 54570bd |
15 | 37a4e21 |
hex | 26282bf |
40010431 has 8 divisors (see below), whose sum is σ = 41201424. Its totient is φ = 38825280.
The previous prime is 40010393. The next prime is 40010441. The reversal of 40010431 is 13401004.
40010431 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 a de Polignac number, because none of the positive numbers 2k-40010431 is a prime.
It is a super-2 number, since 2×400104312 = 3201669177611522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40010441) 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, 15171 + ... + 17611.
It is an arithmetic number, because the mean of its divisors is an integer number (5150178).
Almost surely, 240010431 is an apocalyptic number.
40010431 is a deficient number, since it is larger than the sum of its proper divisors (1190993).
40010431 is a wasteful number, since it uses less digits than its factorization.
40010431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2921.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 40010431 is about 6325.3799095390. The cubic root of 40010431 is about 342.0249146834.
Adding to 40010431 its reverse (13401004), we get a palindrome (53411435).
The spelling of 40010431 in words is "forty million, ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.016 sec. • engine limits •