Base | Representation |
---|---|
bin | 1001011110001101… |
… | …1001111011010011 |
3 | 20120012102112112101 |
4 | 2113203121323103 |
5 | 20201404001401 |
6 | 1100145341231 |
7 | 120003043042 |
oct | 22743317323 |
9 | 6505375471 |
10 | 2542640851 |
11 | 1095288783 |
12 | 5ab637817 |
13 | 316a0c01a |
14 | 1a1990559 |
15 | ed350101 |
hex | 978d9ed3 |
2542640851 has 8 divisors (see below), whose sum is σ = 2613315024. Its totient is φ = 2472069600.
The previous prime is 2542640843. The next prime is 2542640873. The reversal of 2542640851 is 1580462452.
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 2542640851 - 23 = 2542640843 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2542640851.
It is not an unprimeable number, because it can be changed into a prime (2542620851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25776 + ... + 75826.
It is an arithmetic number, because the mean of its divisors is an integer number (326664378).
Almost surely, 22542640851 is an apocalyptic number.
2542640851 is a deficient number, since it is larger than the sum of its proper divisors (70674173).
2542640851 is a wasteful number, since it uses less digits than its factorization.
2542640851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51461.
The product of its (nonzero) digits is 76800, while the sum is 37.
The square root of 2542640851 is about 50424.6056107532. The cubic root of 2542640851 is about 1364.8816869818.
The spelling of 2542640851 in words is "two billion, five hundred forty-two million, six hundred forty thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •