Base | Representation |
---|---|
bin | 10100101000110000… |
… | …01110000110010011 |
3 | 1001121010200100112010 |
4 | 22110120032012103 |
5 | 140142300434023 |
6 | 5031220034003 |
7 | 541361411322 |
oct | 122430160623 |
9 | 31533610463 |
10 | 11079311763 |
11 | 4775a89a03 |
12 | 2192532903 |
13 | 10774a66a0 |
14 | 7716380b9 |
15 | 44ca09093 |
hex | 29460e193 |
11079311763 has 8 divisors (see below), whose sum is σ = 15908755408. Its totient is φ = 6818037984.
The previous prime is 11079311741. The next prime is 11079311779. The reversal of 11079311763 is 36711397011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11079311763 - 25 = 11079311731 is a prime.
It is a super-2 number, since 2×110793117632 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 284084917 = 11079311763 / (1 + 1 + 0 + 7 + 9 + 3 + 1 + 1 + 7 + 6 + 3).
It is not an unprimeable number, because it can be changed into a prime (11079311713) 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, 142042420 + ... + 142042497.
It is an arithmetic number, because the mean of its divisors is an integer number (1988594426).
Almost surely, 211079311763 is an apocalyptic number.
11079311763 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11079311763 is a deficient number, since it is larger than the sum of its proper divisors (4829443645).
11079311763 is a wasteful number, since it uses less digits than its factorization.
11079311763 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284084933.
The product of its (nonzero) digits is 23814, while the sum is 39.
The spelling of 11079311763 in words is "eleven billion, seventy-nine million, three hundred eleven thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •