Base | Representation |
---|---|
bin | 10100101110110011… |
… | …01100100000010111 |
3 | 1001201200010010000011 |
4 | 22113121230200113 |
5 | 140243241430403 |
6 | 5040231101051 |
7 | 542545460233 |
oct | 122731544027 |
9 | 31650103004 |
10 | 11130030103 |
11 | 47a1680395 |
12 | 21a7511787 |
13 | 1084b53a3a |
14 | 77827b5c3 |
15 | 4521c6a6d |
hex | 29766c817 |
11130030103 has 8 divisors (see below), whose sum is σ = 11290164480. Its totient is φ = 10970377080.
The previous prime is 11130030091. The next prime is 11130030133. The reversal of 11130030103 is 30103003111.
It is a happy number.
11130030103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11130030103 - 25 = 11130030071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130030133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73633 + ... + 166378.
It is an arithmetic number, because the mean of its divisors is an integer number (1411270560).
Almost surely, 211130030103 is an apocalyptic number.
11130030103 is a deficient number, since it is larger than the sum of its proper divisors (160134377).
11130030103 is an equidigital number, since it uses as much as digits as its factorization.
11130030103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240677.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 11130030103 its reverse (30103003111), we get a palindrome (41233033214).
The spelling of 11130030103 in words is "eleven billion, one hundred thirty million, thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •