Base | Representation |
---|---|
bin | 10000001100011011011… |
… | …01101110010100101101 |
3 | 1222012020110010010221110 |
4 | 20012031231232110231 |
5 | 33104031124323421 |
6 | 1103341502422233 |
7 | 55125545656431 |
oct | 10061555562455 |
9 | 1865213103843 |
10 | 556428354861 |
11 | 1a4a86333715 |
12 | 8ba0a891979 |
13 | 40617945072 |
14 | 1cd075c89c1 |
15 | e719a25a76 |
hex | 818db6e52d |
556428354861 has 8 divisors (see below), whose sum is σ = 746883698400. Its totient is φ = 368462623952.
The previous prime is 556428354817. The next prime is 556428354869. The reversal of 556428354861 is 168453824655.
556428354861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 556428354861 - 210 = 556428353837 is a prime.
It is a super-2 number, since 2×5564283548612 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556428354869) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 622402635 + ... + 622403528.
It is an arithmetic number, because the mean of its divisors is an integer number (93360462300).
Almost surely, 2556428354861 is an apocalyptic number.
It is an amenable number.
556428354861 is a deficient number, since it is larger than the sum of its proper divisors (190455343539).
556428354861 is a wasteful number, since it uses less digits than its factorization.
556428354861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1244806315.
The product of its digits is 27648000, while the sum is 57.
The spelling of 556428354861 in words is "five hundred fifty-six billion, four hundred twenty-eight million, three hundred fifty-four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •