Base | Representation |
---|---|
bin | 100001001001111… |
… | …001110100100111 |
3 | 1102202200010200101 |
4 | 201021321310213 |
5 | 2114344304023 |
6 | 131110124531 |
7 | 16532666251 |
oct | 4111716447 |
9 | 1382603611 |
10 | 556244263 |
11 | 265a92603 |
12 | 136350747 |
13 | 8b318723 |
14 | 53c36cd1 |
15 | 33c781ad |
hex | 21279d27 |
556244263 has 4 divisors (see below), whose sum is σ = 556520440. Its totient is φ = 555968088.
The previous prime is 556244239. The next prime is 556244281. The reversal of 556244263 is 362442655.
556244263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 362442655 = 5 ⋅72488531.
It is a cyclic number.
It is not a de Polignac number, because 556244263 - 25 = 556244231 is a prime.
It is a super-3 number, since 3×5562442633 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556244963) 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, 135045 + ... + 139102.
It is an arithmetic number, because the mean of its divisors is an integer number (139130110).
Almost surely, 2556244263 is an apocalyptic number.
556244263 is a deficient number, since it is larger than the sum of its proper divisors (276177).
556244263 is a wasteful number, since it uses less digits than its factorization.
556244263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276176.
The product of its digits is 172800, while the sum is 37.
The square root of 556244263 is about 23584.8312056712. The cubic root of 556244263 is about 822.4102508909.
The spelling of 556244263 in words is "five hundred fifty-six million, two hundred forty-four thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •