Base | Representation |
---|---|
bin | 1101111111100110110… |
… | …0001011110111110111 |
3 | 211222112202011210101211 |
4 | 3133321230023313313 |
5 | 12414331022423111 |
6 | 302235514102251 |
7 | 23240432632534 |
oct | 3377154136767 |
9 | 758482153354 |
10 | 240412311031 |
11 | 92a5a533662 |
12 | 3a71571a987 |
13 | 19894933759 |
14 | b8c9339d8b |
15 | 63c1252521 |
hex | 37f9b0bdf7 |
240412311031 has 4 divisors (see below), whose sum is σ = 240538381272. Its totient is φ = 240286240792.
The previous prime is 240412310993. The next prime is 240412311037. The reversal of 240412311031 is 130113214042.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 240412311031 - 27 = 240412310903 is a prime.
It is a super-2 number, since 2×2404123110312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 240412310993 and 240412311011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (240412311037) 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, 63032260 + ... + 63036073.
It is an arithmetic number, because the mean of its divisors is an integer number (60134595318).
Almost surely, 2240412311031 is an apocalyptic number.
240412311031 is a deficient number, since it is larger than the sum of its proper divisors (126070241).
240412311031 is a wasteful number, since it uses less digits than its factorization.
240412311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126070240.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 240412311031 its reverse (130113214042), we get a palindrome (370525525073).
The spelling of 240412311031 in words is "two hundred forty billion, four hundred twelve million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •