Base | Representation |
---|---|
bin | 10100100110011100… |
… | …00111110111000100 |
3 | 1001112210010111112001 |
4 | 22103032013313010 |
5 | 140122312400211 |
6 | 5025243435044 |
7 | 541034331064 |
oct | 122316076704 |
9 | 31483114461 |
10 | 11059887556 |
11 | 4766022243 |
12 | 2187b25a84 |
13 | 1073465383 |
14 | 76cc1d3a4 |
15 | 44ae6dac1 |
hex | 293387dc4 |
11059887556 has 9 divisors (see below), whose sum is σ = 19355171311. Its totient is φ = 5529838612.
The previous prime is 11059887551. The next prime is 11059887569. The reversal of 11059887556 is 65578895011.
The square root of 11059887556 is 105166.
It is a perfect power (a square), and thus also a powerful number.
11059887556 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×110598875562 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11059887497 and 11059887506.
It is not an unprimeable number, because it can be changed into a prime (11059887551) by changing a digit.
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 2 ways as a sum of consecutive naturals, for example, 184041 + ... + 236623.
Almost surely, 211059887556 is an apocalyptic number.
11059887556 is the 105166-th square number.
It is an amenable number.
11059887556 is a deficient number, since it is larger than the sum of its proper divisors (8295283755).
11059887556 is an frugal number, since it uses more digits than its factorization.
11059887556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105170 (or 52585 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 55.
The spelling of 11059887556 in words is "eleven billion, fifty-nine million, eight hundred eighty-seven thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •