Base | Representation |
---|---|
bin | 10100100000100111… |
… | …01011000111000100 |
3 | 1001102101011022111200 |
4 | 22100103223013010 |
5 | 140022304323022 |
6 | 5020340102500 |
7 | 536602022631 |
oct | 122023530704 |
9 | 31371138450 |
10 | 11011011012 |
11 | 4740479601 |
12 | 2173694a30 |
13 | 10662b1441 |
14 | 766539188 |
15 | 446a16bac |
hex | 2904eb1c4 |
11011011012 has 72 divisors (see below), whose sum is σ = 28057629600. Its totient is φ = 3640871808.
The previous prime is 11011011001. The next prime is 11011011017. The reversal of 11011011012 is 21011011011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11011010985 and 11011011003.
It is not an unprimeable number, because it can be changed into a prime (11011011017) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2943039 + ... + 2946777.
It is an arithmetic number, because the mean of its divisors is an integer number (389689300).
Almost surely, 211011011012 is an apocalyptic number.
11011011012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11011011012 is an abundant number, since it is smaller than the sum of its proper divisors (17046618588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011011012 is a wasteful number, since it uses less digits than its factorization.
11011011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4385 (or 4380 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011011012 its reverse (21011011011), we get a palindrome (32022022023).
Subtracting 11011011012 from its reverse (21011011011), we obtain a palindrome (9999999999).
The spelling of 11011011012 in words is "eleven billion, eleven million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •