Base | Representation |
---|---|
bin | 1001011101101010… |
… | …1110001111100000 |
3 | 20120001010220100000 |
4 | 2113122232033200 |
5 | 20200313133033 |
6 | 1100024500000 |
7 | 116644513164 |
oct | 22732561740 |
9 | 6501126300 |
10 | 2540364768 |
11 | 1093a73717 |
12 | 5aa91a600 |
13 | 3163c3026 |
14 | 1a155aca4 |
15 | ed050a13 |
hex | 976ae3e0 |
2540364768 has 72 divisors (see below), whose sum is σ = 7491746808. Its totient is φ = 846785664.
The previous prime is 2540364767. The next prime is 2540364803. The reversal of 2540364768 is 8674630452.
2540364768 is a `hidden beast` number, since 2 + 540 + 3 + 6 + 47 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2540364763) 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 11 ways as a sum of consecutive naturals, for example, 155571 + ... + 171122.
It is an arithmetic number, because the mean of its divisors is an integer number (104052039).
Almost surely, 22540364768 is an apocalyptic number.
It is an amenable number.
2540364768 is an abundant number, since it is smaller than the sum of its proper divisors (4951382040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2540364768 is an equidigital number, since it uses as much as digits as its factorization.
2540364768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326718 (or 326698 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 45.
The square root of 2540364768 is about 50402.0313876336. The cubic root of 2540364768 is about 1364.4743006439.
The spelling of 2540364768 in words is "two billion, five hundred forty million, three hundred sixty-four thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •