Base | Representation |
---|---|
bin | 1001011101101101… |
… | …0000110110110111 |
3 | 20120001102002211020 |
4 | 2113123100312313 |
5 | 20200332202201 |
6 | 1100031512223 |
7 | 116645643432 |
oct | 22733206667 |
9 | 6501362736 |
10 | 2540506551 |
11 | 10940601a0 |
12 | 5aa988673 |
13 | 31644271b |
14 | 1a1596819 |
15 | ed07ca36 |
hex | 976d0db7 |
2540506551 has 8 divisors (see below), whose sum is σ = 3695282304. Its totient is φ = 1539700920.
The previous prime is 2540506531. The next prime is 2540506559. The reversal of 2540506551 is 1556050452.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2540506551 - 211 = 2540504503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 76985047 = 2540506551 / (2 + 5 + 4 + 0 + 5 + 0 + 6 + 5 + 5 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2540506559) 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, 38492491 + ... + 38492556.
It is an arithmetic number, because the mean of its divisors is an integer number (461910288).
Almost surely, 22540506551 is an apocalyptic number.
2540506551 is a deficient number, since it is larger than the sum of its proper divisors (1154775753).
2540506551 is a wasteful number, since it uses less digits than its factorization.
2540506551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76985061.
The product of its (nonzero) digits is 30000, while the sum is 33.
The square root of 2540506551 is about 50403.4378886996. The cubic root of 2540506551 is about 1364.4996848805.
The spelling of 2540506551 in words is "two billion, five hundred forty million, five hundred six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •