Base | Representation |
---|---|
bin | 1010000110110111010000… |
… | …1101100011000001001001 |
3 | 1110100101200011201211201201 |
4 | 2201231310031203001021 |
5 | 2424033441201244423 |
6 | 35345131110544201 |
7 | 2224614150204541 |
oct | 241556415430111 |
9 | 43311604654651 |
10 | 11113030103113 |
11 | 35a5011860374 |
12 | 12b5943368061 |
13 | 627c53615383 |
14 | 2a5c32d5a321 |
15 | 14411e7e02ad |
hex | a1b74363049 |
11113030103113 has 8 divisors (see below), whose sum is σ = 11414473498368. Its totient is φ = 10811644141104.
The previous prime is 11113030103029. The next prime is 11113030103129. The reversal of 11113030103113 is 31130103031111.
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 11113030103113 - 225 = 11112996548681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11113030103173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13965931 + ... + 14740192.
It is an arithmetic number, because the mean of its divisors is an integer number (1426809187296).
Almost surely, 211113030103113 is an apocalyptic number.
It is an amenable number.
11113030103113 is a deficient number, since it is larger than the sum of its proper divisors (301443395255).
11113030103113 is a wasteful number, since it uses less digits than its factorization.
11113030103113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28716623.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 11113030103113 its reverse (31130103031111), we get a palindrome (42243133134224).
The spelling of 11113030103113 in words is "eleven trillion, one hundred thirteen billion, thirty million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •