Base | Representation |
---|---|
bin | 10100100000101000… |
… | …01000110010101110 |
3 | 1001102101101111021120 |
4 | 22100110020302232 |
5 | 140022322220330 |
6 | 5020342441410 |
7 | 536603040243 |
oct | 122024106256 |
9 | 31371344246 |
10 | 11011132590 |
11 | 4740551987 |
12 | 2173733266 |
13 | 1066324893 |
14 | 76656b5ca |
15 | 446a3cc10 |
hex | 290508cae |
11011132590 has 32 divisors (see below), whose sum is σ = 26430243840. Its totient is φ = 2935910304.
The previous prime is 11011132511. The next prime is 11011132591. The reversal of 11011132590 is 9523111011.
It is a self number, because there is not a number n which added to its sum of digits gives 11011132590.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011132591) 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 15 ways as a sum of consecutive naturals, for example, 257307 + ... + 297033.
It is an arithmetic number, because the mean of its divisors is an integer number (825945120).
Almost surely, 211011132590 is an apocalyptic number.
11011132590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011132590 is an abundant number, since it is smaller than the sum of its proper divisors (15419111250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011132590 is a wasteful number, since it uses less digits than its factorization.
11011132590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48976.
The product of its (nonzero) digits is 270, while the sum is 24.
The spelling of 11011132590 in words is "eleven billion, eleven million, one hundred thirty-two thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •