Base | Representation |
---|---|
bin | 100001001010100… |
… | …101110101101101 |
3 | 1102210000021222221 |
4 | 201022211311231 |
5 | 2114421041212 |
6 | 131114035341 |
7 | 16534350013 |
oct | 4112456555 |
9 | 1383007887 |
10 | 556424557 |
11 | 2660a6007 |
12 | 136418b51 |
13 | 8b37c800 |
14 | 53c828b3 |
15 | 33cb1807 |
hex | 212a5d6d |
556424557 has 24 divisors (see below), whose sum is σ = 639036000. Its totient is φ = 482908608.
The previous prime is 556424521. The next prime is 556424567. The reversal of 556424557 is 755424655.
556424557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 556424557 - 219 = 555900269 is a prime.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
Its product of digits (840000) is a multiple of the sum of its prime divisors (1344).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556424507) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 477858 + ... + 479020.
It is an arithmetic number, because the mean of its divisors is an integer number (26626500).
Almost surely, 2556424557 is an apocalyptic number.
It is an amenable number.
556424557 is a deficient number, since it is larger than the sum of its proper divisors (82611443).
556424557 is a wasteful number, since it uses less digits than its factorization.
556424557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1357 (or 1344 counting only the distinct ones).
The product of its digits is 840000, while the sum is 43.
The square root of 556424557 is about 23588.6531408641. The cubic root of 556424557 is about 822.4990965213.
The spelling of 556424557 in words is "five hundred fifty-six million, four hundred twenty-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •