Base | Representation |
---|---|
bin | 10100100111000111… |
… | …01010111000010101 |
3 | 1001120011202110202110 |
4 | 22103203222320111 |
5 | 140130234123041 |
6 | 5030004501233 |
7 | 541133334651 |
oct | 122343527025 |
9 | 31504673673 |
10 | 11065536021 |
11 | 476922aaa1 |
12 | 21899aa819 |
13 | 1074692367 |
14 | 76d88da61 |
15 | 44b6d7516 |
hex | 2938eae15 |
11065536021 has 8 divisors (see below), whose sum is σ = 15097165600. Its totient is φ = 7205465232.
The previous prime is 11065536007. The next prime is 11065536029. The reversal of 11065536021 is 12063556011.
11065536021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11065536021 - 27 = 11065535893 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11065536021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11065536029) 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 7 ways as a sum of consecutive naturals, for example, 42889546 + ... + 42889803.
It is an arithmetic number, because the mean of its divisors is an integer number (1887145700).
Almost surely, 211065536021 is an apocalyptic number.
It is an amenable number.
11065536021 is a deficient number, since it is larger than the sum of its proper divisors (4031629579).
11065536021 is an equidigital number, since it uses as much as digits as its factorization.
11065536021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85779395.
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 11065536021 in words is "eleven billion, sixty-five million, five hundred thirty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •