Base | Representation |
---|---|
bin | 100000011101111… |
… | …110011111100001 |
3 | 1101222000002210021 |
4 | 200131332133201 |
5 | 2103422312212 |
6 | 130015233441 |
7 | 16333056235 |
oct | 4035763741 |
9 | 1358002707 |
10 | 544729057 |
11 | 25a538004 |
12 | 132518881 |
13 | 88b162b2 |
14 | 524ba5c5 |
15 | 32c51307 |
hex | 2077e7e1 |
544729057 has 4 divisors (see below), whose sum is σ = 550122516. Its totient is φ = 539335600.
The previous prime is 544729037. The next prime is 544729061. The reversal of 544729057 is 750927445.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 750927445 = 5 ⋅150185489.
It can be written as a sum of positive squares in 2 ways, for example, as 312440976 + 232288081 = 17676^2 + 15241^2 .
It is a cyclic number.
It is not a de Polignac number, because 544729057 - 223 = 536340449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (544729007) 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 3 ways as a sum of consecutive naturals, for example, 2696578 + ... + 2696779.
It is an arithmetic number, because the mean of its divisors is an integer number (137530629).
Almost surely, 2544729057 is an apocalyptic number.
It is an amenable number.
544729057 is a deficient number, since it is larger than the sum of its proper divisors (5393459).
544729057 is a wasteful number, since it uses less digits than its factorization.
544729057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5393458.
The product of its (nonzero) digits is 352800, while the sum is 43.
The square root of 544729057 is about 23339.4313769637. The cubic root of 544729057 is about 816.6955339696.
The spelling of 544729057 in words is "five hundred forty-four million, seven hundred twenty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •