Base | Representation |
---|---|
bin | 10100011111111001… |
… | …11010010000011000 |
3 | 1001101221221010221110 |
4 | 22033330322100120 |
5 | 140014242344421 |
6 | 5020004140320 |
7 | 536500220421 |
oct | 121774722030 |
9 | 31357833843 |
10 | 11005043736 |
11 | 4738073275 |
12 | 21716976a0 |
13 | 1064ca22cb |
14 | 765824648 |
15 | 446238a76 |
hex | 28ff3a418 |
11005043736 has 128 divisors (see below), whose sum is σ = 28394150400. Its totient is φ = 3553320960.
The previous prime is 11005043701. The next prime is 11005043737. The reversal of 11005043736 is 63734050011.
11005043736 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×110050437362 (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 (11005043737) 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 31 ways as a sum of consecutive naturals, for example, 35846895 + ... + 35847201.
It is an arithmetic number, because the mean of its divisors is an integer number (221829300).
Almost surely, 211005043736 is an apocalyptic number.
It is an amenable number.
11005043736 is an abundant number, since it is smaller than the sum of its proper divisors (17389106664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11005043736 is a wasteful number, since it uses less digits than its factorization.
11005043736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689 (or 685 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 30.
Adding to 11005043736 its reverse (63734050011), we get a palindrome (74739093747).
The spelling of 11005043736 in words is "eleven billion, five million, forty-three thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •