Base | Representation |
---|---|
bin | 10100100110000000… |
… | …00101101101100001 |
3 | 1001112112012121010111 |
4 | 22103000011231201 |
5 | 140120342134422 |
6 | 5025032531321 |
7 | 540661136500 |
oct | 122300055541 |
9 | 31475177114 |
10 | 11056208737 |
11 | 4763a3a2a2 |
12 | 2186850b41 |
13 | 1072777a62 |
14 | 76c542837 |
15 | 44a993a77 |
hex | 293005b61 |
11056208737 has 18 divisors (see below), whose sum is σ = 13573863378. Its totient is φ = 8977959648.
The previous prime is 11056208651. The next prime is 11056208743. The reversal of 11056208737 is 73780265011.
It can be written as a sum of positive squares in only one way, i.e., 10136663761 + 919544976 = 100681^2 + 30324^2 .
It is a de Polignac number, because none of the positive numbers 2k-11056208737 is a prime.
It is a super-2 number, since 2×110562087372 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11056208737.
It is not an unprimeable number, because it can be changed into a prime (11056208797) 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 17 ways as a sum of consecutive naturals, for example, 294828 + ... + 330205.
It is an arithmetic number, because the mean of its divisors is an integer number (754103521).
Almost surely, 211056208737 is an apocalyptic number.
It is an amenable number.
11056208737 is a deficient number, since it is larger than the sum of its proper divisors (2517654641).
11056208737 is an equidigital number, since it uses as much as digits as its factorization.
11056208737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625085 (or 625059 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 11056208737 in words is "eleven billion, fifty-six million, two hundred eight thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •