Base | Representation |
---|---|
bin | 10100100011101101… |
… | …10101010100011100 |
3 | 1001111012001221200002 |
4 | 22101312311110130 |
5 | 140100433130314 |
6 | 5023105153432 |
7 | 540335665250 |
oct | 122166652434 |
9 | 31435057602 |
10 | 11037005084 |
11 | 4754113306 |
12 | 218032b878 |
13 | 106b7b2c51 |
14 | 769b84260 |
15 | 448e4dade |
hex | 291db551c |
11037005084 has 12 divisors (see below), whose sum is σ = 22074010224. Its totient is φ = 4730145024.
The previous prime is 11037005069. The next prime is 11037005129. The reversal of 11037005084 is 48050073011.
11037005084 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
11037005084 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 197089349 + ... + 197089404.
It is an arithmetic number, because the mean of its divisors is an integer number (1839500852).
Almost surely, 211037005084 is an apocalyptic number.
11037005084 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11037005084 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11037005084 is a wasteful number, since it uses less digits than its factorization.
11037005084 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394178764 (or 394178762 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 29.
Adding to 11037005084 its reverse (48050073011), we get a palindrome (59087078095).
The spelling of 11037005084 in words is "eleven billion, thirty-seven million, five thousand, eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •