Base | Representation |
---|---|
bin | 10100100000111100… |
… | …01100000101110000 |
3 | 1001102120100100202011 |
4 | 22100132030011300 |
5 | 140024011030121 |
6 | 5020515132304 |
7 | 536634323302 |
oct | 122036140560 |
9 | 31376310664 |
10 | 11013767536 |
11 | 4741a91622 |
12 | 21745a4094 |
13 | 1066a38015 |
14 | 766a55972 |
15 | 446dad7e1 |
hex | 29078c170 |
11013767536 has 20 divisors (see below), whose sum is σ = 21342341592. Its totient is φ = 5506066496.
The previous prime is 11013767521. The next prime is 11013767537. The reversal of 11013767536 is 63576731011.
It is a super-2 number, since 2×110137675362 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013767537) 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 3 ways as a sum of consecutive naturals, for example, 68595 + ... + 163501.
Almost surely, 211013767536 is an apocalyptic number.
11013767536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11013767536 is a deficient number, since it is larger than the sum of its proper divisors (10328574056).
11013767536 is an equidigital number, since it uses as much as digits as its factorization.
11013767536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102168 (or 102162 counting only the distinct ones).
The product of its (nonzero) digits is 79380, while the sum is 40.
The spelling of 11013767536 in words is "eleven billion, thirteen million, seven hundred sixty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •