Base | Representation |
---|---|
bin | 100000001110011… |
… | …001111010000101 |
3 | 1101200022201022122 |
4 | 200032121322011 |
5 | 2101401201140 |
6 | 125351535325 |
7 | 16253265311 |
oct | 4016317205 |
9 | 1350281278 |
10 | 540647045 |
11 | 2581aa144 |
12 | 13108a545 |
13 | 880172c3 |
14 | 51b36b41 |
15 | 326e6ab5 |
hex | 20399e85 |
540647045 has 8 divisors (see below), whose sum is σ = 651302424. Its totient is φ = 430833664.
The previous prime is 540647027. The next prime is 540647111. The reversal of 540647045 is 540746045.
It can be written as a sum of positive squares in 4 ways, for example, as 202749121 + 337897924 = 14239^2 + 18382^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-540647045 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 540646996 and 540647014.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 209084 + ... + 211653.
It is an arithmetic number, because the mean of its divisors is an integer number (81412803).
Almost surely, 2540647045 is an apocalyptic number.
It is an amenable number.
540647045 is a deficient number, since it is larger than the sum of its proper divisors (110655379).
540647045 is a wasteful number, since it uses less digits than its factorization.
540647045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420999.
The product of its (nonzero) digits is 67200, while the sum is 35.
The square root of 540647045 is about 23251.8181009572. The cubic root of 540647045 is about 814.6504052208.
The spelling of 540647045 in words is "five hundred forty million, six hundred forty-seven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •