Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00011100001011010 |
3 | 1001102101100101200000 |
4 | 22100110003201122 |
5 | 140022321023002 |
6 | 5020342153430 |
7 | 536602620303 |
oct | 122024034132 |
9 | 31371311600 |
10 | 11011111002 |
11 | 4740537741 |
12 | 2173722876 |
13 | 1066317ac8 |
14 | 7665637aa |
15 | 446a3661c |
hex | 29050385a |
11011111002 has 48 divisors (see below), whose sum is σ = 26043195360. Its totient is φ = 3477190032.
The previous prime is 11011110991. The next prime is 11011111009. The reversal of 11011111002 is 20011111011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11011111009) 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, 586993 + ... + 605460.
It is an arithmetic number, because the mean of its divisors is an integer number (542566570).
Almost surely, 211011111002 is an apocalyptic number.
11011111002 is an abundant number, since it is smaller than the sum of its proper divisors (15032084358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011111002 is a wasteful number, since it uses less digits than its factorization.
11011111002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1192489 (or 1192477 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011111002 its reverse (20011111011), we get a palindrome (31022222013).
Subtracting 11011111002 from its reverse (20011111011), we obtain a palindrome (9000000009).
The spelling of 11011111002 in words is "eleven billion, eleven million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •