Base | Representation |
---|---|
bin | 1001000101110001… |
… | …1010000010110111 |
3 | 20022001120002221211 |
4 | 2101130122002313 |
5 | 14444134034111 |
6 | 1042044422251 |
7 | 114316605424 |
oct | 22134320267 |
9 | 6261502854 |
10 | 2440143031 |
11 | 1042440637 |
12 | 581247987 |
13 | 2cb702621 |
14 | 19210cd4b |
15 | e4355521 |
hex | 9171a0b7 |
2440143031 has 8 divisors (see below), whose sum is σ = 2461842720. Its totient is φ = 2418499968.
The previous prime is 2440143019. The next prime is 2440143047. The reversal of 2440143031 is 1303410442.
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 2440143031 - 213 = 2440134839 is a prime.
It is a super-2 number, since 2×24401430312 = 11908596023475733922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2440142993 and 2440143011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2440143011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74875 + ... + 102403.
It is an arithmetic number, because the mean of its divisors is an integer number (307730340).
Almost surely, 22440143031 is an apocalyptic number.
2440143031 is a deficient number, since it is larger than the sum of its proper divisors (21699689).
2440143031 is a wasteful number, since it uses less digits than its factorization.
2440143031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28313.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2440143031 is about 49397.8039086759. The cubic root of 2440143031 is about 1346.2894045890.
Adding to 2440143031 its reverse (1303410442), we get a palindrome (3743553473).
The spelling of 2440143031 in words is "two billion, four hundred forty million, one hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •