Base | Representation |
---|---|
bin | 100101100011010001… |
… | …100000100110011111 |
3 | 10212001222122102020101 |
4 | 211203101200212133 |
5 | 1130033440140111 |
6 | 30304534401531 |
7 | 2625113246131 |
oct | 454321404637 |
9 | 125058572211 |
10 | 40320240031 |
11 | 161107a7125 |
12 | 79932002a7 |
13 | 3a57518ac6 |
14 | 1d46d2d051 |
15 | 10aeb92bc1 |
hex | 96346099f |
40320240031 has 8 divisors (see below), whose sum is σ = 40696745760. Its totient is φ = 39943854432.
The previous prime is 40320240013. The next prime is 40320240047. The reversal of 40320240031 is 13004202304.
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 40320240031 - 27 = 40320239903 is a prime.
It is a super-2 number, since 2×403202400312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40320239990 and 40320240008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40320247031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 734661 + ... + 787633.
It is an arithmetic number, because the mean of its divisors is an integer number (5087093220).
Almost surely, 240320240031 is an apocalyptic number.
40320240031 is a deficient number, since it is larger than the sum of its proper divisors (376505729).
40320240031 is a wasteful number, since it uses less digits than its factorization.
40320240031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60065.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 40320240031 its reverse (13004202304), we get a palindrome (53324442335).
The spelling of 40320240031 in words is "forty billion, three hundred twenty million, two hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •