Base | Representation |
---|---|
bin | 10000001100110001111… |
… | …00000001001100100000 |
3 | 1222012201120102121102222 |
4 | 20012120330001030200 |
5 | 33104422330322202 |
6 | 1103412310330212 |
7 | 55133323321403 |
oct | 10063074011440 |
9 | 1865646377388 |
10 | 556616651552 |
11 | 1a5072652815 |
12 | 8ba61959968 |
13 | 40647962420 |
14 | 1cd24601d3a |
15 | e72b31c4a2 |
hex | 8198f01320 |
556616651552 has 24 divisors (see below), whose sum is σ = 1180134343836. Its totient is φ = 256899992832.
The previous prime is 556616651551. The next prime is 556616651573. The reversal of 556616651552 is 255156616655.
It can be written as a sum of positive squares in 2 ways, for example, as 467194122256 + 89422529296 = 683516^2 + 299036^2 .
It is a junction number, because it is equal to n+sod(n) for n = 556616651494 and 556616651503.
It is not an unprimeable number, because it can be changed into a prime (556616651551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 669009983 + ... + 669010814.
Almost surely, 2556616651552 is an apocalyptic number.
556616651552 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
556616651552 is an abundant number, since it is smaller than the sum of its proper divisors (623517692284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556616651552 is a wasteful number, since it uses less digits than its factorization.
556616651552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1338020820 (or 1338020812 counting only the distinct ones).
The product of its digits is 8100000, while the sum is 53.
The spelling of 556616651552 in words is "five hundred fifty-six billion, six hundred sixteen million, six hundred fifty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •