Base | Representation |
---|---|
bin | 11110101111111110100… |
… | …10110001111000101001 |
3 | 10202000010210102011211111 |
4 | 33113333102301320221 |
5 | 114302303311204041 |
6 | 2125212235230321 |
7 | 136222203450526 |
oct | 17277722617051 |
9 | 3660123364744 |
10 | 1056550100521 |
11 | 378097a95463 |
12 | 1509245a83a1 |
13 | 7882b07b496 |
14 | 391cca6014d |
15 | 1c73b1a6981 |
hex | f5ff4b1e29 |
1056550100521 has 8 divisors (see below), whose sum is σ = 1139807656584. Its totient is φ = 975637827840.
The previous prime is 1056550100503. The next prime is 1056550100549. The reversal of 1056550100521 is 1250010556501.
It can be written as a sum of positive squares in 4 ways, for example, as 169871744025 + 886678356496 = 412155^2 + 941636^2 .
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 1056550100521 - 235 = 1022190362153 is a prime.
It is a super-2 number, since 2×10565501005212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1056550170521) 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, 586319910 + ... + 586321711.
It is an arithmetic number, because the mean of its divisors is an integer number (142475957073).
Almost surely, 21056550100521 is an apocalyptic number.
It is an amenable number.
1056550100521 is a deficient number, since it is larger than the sum of its proper divisors (83257556063).
1056550100521 is a wasteful number, since it uses less digits than its factorization.
1056550100521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172641691.
The product of its (nonzero) digits is 7500, while the sum is 31.
The spelling of 1056550100521 in words is "one trillion, fifty-six billion, five hundred fifty million, one hundred thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •