Base | Representation |
---|---|
bin | 10100011111110010… |
… | …01110001011000100 |
3 | 1001101220010000110210 |
4 | 22033321032023010 |
5 | 140014020423430 |
6 | 5015531315420 |
7 | 536456052246 |
oct | 121771161304 |
9 | 31356100423 |
10 | 11004076740 |
11 | 47375727a8 |
12 | 21712abb70 |
13 | 1064a24117 |
14 | 765652096 |
15 | 4460e72b0 |
hex | 28fe4e2c4 |
11004076740 has 48 divisors (see below), whose sum is σ = 30989544768. Its totient is φ = 2917455744.
The previous prime is 11004076711. The next prime is 11004076751. The reversal of 11004076740 is 4767040011.
11004076740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 11004076698 and 11004076707.
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 15 ways as a sum of consecutive naturals, for example, 519682 + ... + 540441.
It is an arithmetic number, because the mean of its divisors is an integer number (645615516).
Almost surely, 211004076740 is an apocalyptic number.
11004076740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11004076740 is an abundant number, since it is smaller than the sum of its proper divisors (19985468028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11004076740 is a wasteful number, since it uses less digits than its factorization.
11004076740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060308 (or 1060306 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
The spelling of 11004076740 in words is "eleven billion, four million, seventy-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •