Base | Representation |
---|---|
bin | 10100101110110011… |
… | …00101001011100110 |
3 | 1001201200001120212000 |
4 | 22113121211023212 |
5 | 140243240000402 |
6 | 5040230310130 |
7 | 542545303614 |
oct | 122731451346 |
9 | 31650046760 |
10 | 11130000102 |
11 | 47a165a8a1 |
12 | 21a74b8346 |
13 | 1084b431a0 |
14 | 7782706b4 |
15 | 4521bcc1c |
hex | 2976652e6 |
11130000102 has 64 divisors (see below), whose sum is σ = 26694951360. Its totient is φ = 3417023232.
The previous prime is 11130000047. The next prime is 11130000157. The reversal of 11130000102 is 20100003111.
It is an interprime number because it is at equal distance from previous prime (11130000047) and next prime (11130000157).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 303468 + ... + 338160.
It is an arithmetic number, because the mean of its divisors is an integer number (417108615).
Almost surely, 211130000102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11130000102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13347475680).
11130000102 is an abundant number, since it is smaller than the sum of its proper divisors (15564951258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11130000102 is a wasteful number, since it uses less digits than its factorization.
11130000102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35174 (or 35168 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 11130000102 its reverse (20100003111), we get a palindrome (31230003213).
The spelling of 11130000102 in words is "eleven billion, one hundred thirty million, one hundred two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •