Base | Representation |
---|---|
bin | 101111001101011011111… |
… | …001001000011111101111 |
3 | 102111010221210201001010212 |
4 | 233031123321020133233 |
5 | 411123201423342033 |
6 | 10522214553253035 |
7 | 453250225051166 |
oct | 57153371103757 |
9 | 12433853631125 |
10 | 3244242012143 |
11 | 104096a047480 |
12 | 44490a10417b |
13 | 1a6c139c9992 |
14 | b3044ad63dd |
15 | 595cbccc748 |
hex | 2f35be487ef |
3244242012143 has 8 divisors (see below), whose sum is σ = 3557702808576. Its totient is φ = 2933869499800.
The previous prime is 3244242012139. The next prime is 3244242012211. The reversal of 3244242012143 is 3412102424423.
It is a happy number.
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 3244242012143 - 22 = 3244242012139 is a prime.
It is a super-2 number, since 2×32442420121432 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3244242012103) 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, 772068821 + ... + 772073022.
It is an arithmetic number, because the mean of its divisors is an integer number (444712851072).
Almost surely, 23244242012143 is an apocalyptic number.
3244242012143 is a deficient number, since it is larger than the sum of its proper divisors (313460796433).
3244242012143 is a wasteful number, since it uses less digits than its factorization.
3244242012143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544142045.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 3244242012143 its reverse (3412102424423), we get a palindrome (6656344436566).
The spelling of 3244242012143 in words is "three trillion, two hundred forty-four billion, two hundred forty-two million, twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •