Base | Representation |
---|---|
bin | 1001011110000111… |
… | …1000001010111011 |
3 | 20120011200012021110 |
4 | 2113201320022323 |
5 | 20201303143233 |
6 | 1100133011403 |
7 | 116666454501 |
oct | 22741701273 |
9 | 6504605243 |
10 | 2542240443 |
11 | 1095034966 |
12 | 5ab483b63 |
13 | 3168cb9b2 |
14 | 1a18c8671 |
15 | ed2c1663 |
hex | 978782bb |
2542240443 has 8 divisors (see below), whose sum is σ = 3389921856. Its totient is φ = 1694693000.
The previous prime is 2542240433. The next prime is 2542240447. The reversal of 2542240443 is 3440422452.
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 2542240443 - 226 = 2475131579 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2542240443.
It is not an unprimeable number, because it can be changed into a prime (2542240447) 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, 25768 + ... + 75818.
It is an arithmetic number, because the mean of its divisors is an integer number (423740232).
Almost surely, 22542240443 is an apocalyptic number.
2542240443 is a deficient number, since it is larger than the sum of its proper divisors (847681413).
2542240443 is a wasteful number, since it uses less digits than its factorization.
2542240443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66985.
The product of its (nonzero) digits is 30720, while the sum is 30.
The square root of 2542240443 is about 50420.6350912005. The cubic root of 2542240443 is about 1364.8100372983.
Adding to 2542240443 its reverse (3440422452), we get a palindrome (5982662895).
The spelling of 2542240443 in words is "two billion, five hundred forty-two million, two hundred forty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.630 sec. • engine limits •