Base | Representation |
---|---|
bin | 100000001110110… |
… | …110101011000001 |
3 | 1101200112200221100 |
4 | 200032312223001 |
5 | 2101413433430 |
6 | 125354245013 |
7 | 16254265644 |
oct | 4016665301 |
9 | 1350480840 |
10 | 540764865 |
11 | 25827a713 |
12 | 131126769 |
13 | 88058b14 |
14 | 51b67a5b |
15 | 3271b960 |
hex | 203b6ac1 |
540764865 has 24 divisors (see below), whose sum is σ = 938508480. Its totient is φ = 288044064.
The previous prime is 540764863. The next prime is 540764869. The reversal of 540764865 is 568467045.
540764865 is a `hidden beast` number, since 540 + 7 + 6 + 48 + 65 = 666.
It is not a de Polignac number, because 540764865 - 21 = 540764863 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 540764865.
It is not an unprimeable number, because it can be changed into a prime (540764863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30594 + ... + 44916.
It is an arithmetic number, because the mean of its divisors is an integer number (39104520).
Almost surely, 2540764865 is an apocalyptic number.
It is an amenable number.
540764865 is a deficient number, since it is larger than the sum of its proper divisors (397743615).
540764865 is a wasteful number, since it uses less digits than its factorization.
540764865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15173 (or 15170 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 45.
The square root of 540764865 is about 23254.3515282624. The cubic root of 540764865 is about 814.7095782310.
The spelling of 540764865 in words is "five hundred forty million, seven hundred sixty-four thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •