Base | Representation |
---|---|
bin | 100000001101010… |
… | …011110101111001 |
3 | 1101122210010122110 |
4 | 200031103311321 |
5 | 2101313010212 |
6 | 125341442533 |
7 | 16250661516 |
oct | 4015236571 |
9 | 1348703573 |
10 | 540360057 |
11 | 258023566 |
12 | 130b70449 |
13 | 87c467a3 |
14 | 51aa030d |
15 | 3268ba3c |
hex | 20353d79 |
540360057 has 8 divisors (see below), whose sum is σ = 758400160. Its totient is φ = 341280000.
The previous prime is 540359971. The next prime is 540360061. The reversal of 540360057 is 750063045.
540360057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 540360057 - 212 = 540355961 is a prime.
It is a super-3 number, since 3×5403600573 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (540360077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4739944 + ... + 4740057.
It is an arithmetic number, because the mean of its divisors is an integer number (94800020).
Almost surely, 2540360057 is an apocalyptic number.
540360057 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
540360057 is a deficient number, since it is larger than the sum of its proper divisors (218040103).
540360057 is a wasteful number, since it uses less digits than its factorization.
540360057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9480023.
The product of its (nonzero) digits is 12600, while the sum is 30.
The square root of 540360057 is about 23245.6459794087. The cubic root of 540360057 is about 814.5062345937.
The spelling of 540360057 in words is "five hundred forty million, three hundred sixty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •