Base | Representation |
---|---|
bin | 10100101111101100… |
… | …00000000101010000 |
3 | 1001202012002002122000 |
4 | 22113312000011100 |
5 | 140302141402240 |
6 | 5041054114000 |
7 | 542665523433 |
oct | 122766000520 |
9 | 31665062560 |
10 | 11137450320 |
11 | 47a58892a7 |
12 | 21a9aab900 |
13 | 10865512b9 |
14 | 77924d81a |
15 | 452b90430 |
hex | 297d80150 |
11137450320 has 80 divisors (see below), whose sum is σ = 38362336320. Its totient is φ = 2969986176.
The previous prime is 11137450297. The next prime is 11137450393. The reversal of 11137450320 is 2305473111.
11137450320 is a `hidden beast` number, since 1 + 1 + 137 + 4 + 503 + 20 = 666.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2575954 + ... + 2580273.
It is an arithmetic number, because the mean of its divisors is an integer number (479529204).
Almost surely, 211137450320 is an apocalyptic number.
11137450320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11137450320 is an abundant number, since it is smaller than the sum of its proper divisors (27224886000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11137450320 is a wasteful number, since it uses less digits than its factorization.
11137450320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5156249 (or 5156237 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The spelling of 11137450320 in words is "eleven billion, one hundred thirty-seven million, four hundred fifty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •