Base | Representation |
---|---|
bin | 1001100100010… |
… | …1101000000001 |
3 | 2210111212111001 |
4 | 2121011220001 |
5 | 40233143243 |
6 | 3552052001 |
7 | 665052133 |
oct | 231055001 |
9 | 83455431 |
10 | 40131073 |
11 | 20720084 |
12 | 11534001 |
13 | 84113c8 |
14 | 5489053 |
15 | 37caa4d |
hex | 2645a01 |
40131073 has 4 divisors (see below), whose sum is σ = 40158468. Its totient is φ = 40103680.
The previous prime is 40131071. The next prime is 40131109. The reversal of 40131073 is 37013104.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7091569 + 33039504 = 2663^2 + 5748^2 .
It is a cyclic number.
It is not a de Polignac number, because 40131073 - 21 = 40131071 is a prime.
It is a super-2 number, since 2×401310732 = 3221006040262658, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40131073.
It is not an unprimeable number, because it can be changed into a prime (40131071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11368 + ... + 14473.
It is an arithmetic number, because the mean of its divisors is an integer number (10039617).
Almost surely, 240131073 is an apocalyptic number.
It is an amenable number.
40131073 is a deficient number, since it is larger than the sum of its proper divisors (27395).
40131073 is a wasteful number, since it uses less digits than its factorization.
40131073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27394.
The product of its (nonzero) digits is 252, while the sum is 19.
The square root of 40131073 is about 6334.9090759063. The cubic root of 40131073 is about 342.3683348496.
Adding to 40131073 its reverse (37013104), we get a palindrome (77144177).
The spelling of 40131073 in words is "forty million, one hundred thirty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •