Base | Representation |
---|---|
bin | 100001001100000… |
… | …001010001000001 |
3 | 1102210201022200201 |
4 | 201030001101001 |
5 | 2120020032131 |
6 | 131130045201 |
7 | 16540466551 |
oct | 4114012101 |
9 | 1383638621 |
10 | 556799041 |
11 | 2663313a7 |
12 | 136579801 |
13 | 8b4810b6 |
14 | 53d3d161 |
15 | 33d37761 |
hex | 21301441 |
556799041 has 4 divisors (see below), whose sum is σ = 563055300. Its totient is φ = 550542784.
The previous prime is 556799021. The next prime is 556799057. The reversal of 556799041 is 140997655.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 140997655 = 5 ⋅28199531.
It can be written as a sum of positive squares in 2 ways, for example, as 219158416 + 337640625 = 14804^2 + 18375^2 .
It is a cyclic number.
It is not a de Polignac number, because 556799041 - 213 = 556790849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 556798982 and 556799000.
It is not an unprimeable number, because it can be changed into a prime (556799021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3127996 + ... + 3128173.
It is an arithmetic number, because the mean of its divisors is an integer number (140763825).
Almost surely, 2556799041 is an apocalyptic number.
It is an amenable number.
556799041 is a deficient number, since it is larger than the sum of its proper divisors (6256259).
556799041 is an equidigital number, since it uses as much as digits as its factorization.
556799041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6256258.
The product of its (nonzero) digits is 340200, while the sum is 46.
The square root of 556799041 is about 23596.5896052798. The cubic root of 556799041 is about 822.6835741677.
The spelling of 556799041 in words is "five hundred fifty-six million, seven hundred ninety-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •