Base | Representation |
---|---|
bin | 11110101110001000000… |
… | …11000000011011100010 |
3 | 10201220120112001020020121 |
4 | 33113010003000123202 |
5 | 114243234331010200 |
6 | 2124525450430454 |
7 | 136155443616241 |
oct | 17270403003342 |
9 | 3656515036217 |
10 | 1055556110050 |
11 | 3777279a6732 |
12 | 1506a773242a |
13 | 78700166740 |
14 | 39136a38958 |
15 | 1c6cdcb0e1a |
hex | f5c40c06e2 |
1055556110050 has 48 divisors (see below), whose sum is σ = 2114695353960. Its totient is φ = 389681994240.
The previous prime is 1055556110047. The next prime is 1055556110087. The reversal of 1055556110050 is 500116555501.
It can be written as a sum of positive squares in 12 ways, for example, as 256057252441 + 799498857609 = 506021^2 + 894147^2 .
It is a super-2 number, since 2×10555561100502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055556109988 and 1055556110015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4079334 + ... + 4330366.
Almost surely, 21055556110050 is an apocalyptic number.
1055556110050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1055556110050 is an abundant number, since it is smaller than the sum of its proper divisors (1059139243910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055556110050 is a wasteful number, since it uses less digits than its factorization.
1055556110050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257527 (or 257522 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 1055556110050 in words is "one trillion, fifty-five billion, five hundred fifty-six million, one hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •