Base | Representation |
---|---|
bin | 100000001100001… |
… | …001101100011001 |
3 | 1101122012201000212 |
4 | 200030021230121 |
5 | 2101223300340 |
6 | 125331140505 |
7 | 16245255203 |
oct | 4014115431 |
9 | 1348181025 |
10 | 540056345 |
11 | 257936364 |
12 | 130a44735 |
13 | 87b6b48a |
14 | 51a21773 |
15 | 3262ba65 |
hex | 20309b19 |
540056345 has 4 divisors (see below), whose sum is σ = 648067620. Its totient is φ = 432045072.
The previous prime is 540056339. The next prime is 540056347. The reversal of 540056345 is 543650045.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 543650045 = 5 ⋅108730009.
It can be written as a sum of positive squares in 2 ways, for example, as 223323136 + 316733209 = 14944^2 + 17797^2 .
It is a cyclic number.
It is not a de Polignac number, because 540056345 - 214 = 540039961 is a prime.
It is not an unprimeable number, because it can be changed into a prime (540056347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54005630 + ... + 54005639.
It is an arithmetic number, because the mean of its divisors is an integer number (162016905).
Almost surely, 2540056345 is an apocalyptic number.
It is an amenable number.
540056345 is a deficient number, since it is larger than the sum of its proper divisors (108011275).
540056345 is a wasteful number, since it uses less digits than its factorization.
540056345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108011274.
The product of its (nonzero) digits is 36000, while the sum is 32.
The square root of 540056345 is about 23239.1123969914. The cubic root of 540056345 is about 814.3536069306.
The spelling of 540056345 in words is "five hundred forty million, fifty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •