Base | Representation |
---|---|
bin | 1010000111110110111001… |
… | …1100110001011011110101 |
3 | 1110102000202201210011121102 |
4 | 2201331232130301123311 |
5 | 2424323433001101323 |
6 | 35401034203055445 |
7 | 2226060404036105 |
oct | 241755634613365 |
9 | 43360681704542 |
10 | 11130113300213 |
11 | 3601288884186 |
12 | 12b9110511585 |
13 | 62974691811b |
14 | 2a69b3ad5205 |
15 | 1447be44d328 |
hex | a1f6e7316f5 |
11130113300213 has 8 divisors (see below), whose sum is σ = 11389718620896. Its totient is φ = 10870542774000.
The previous prime is 11130113300143. The next prime is 11130113300233. The reversal of 11130113300213 is 31200331103111.
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 11130113300213 - 216 = 11130113234677 is a prime.
It is a super-4 number, since 4×111301133002134 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130113300233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8050838 + ... + 9331463.
It is an arithmetic number, because the mean of its divisors is an integer number (1423714827612).
Almost surely, 211130113300213 is an apocalyptic number.
It is an amenable number.
11130113300213 is a deficient number, since it is larger than the sum of its proper divisors (259605320683).
11130113300213 is a wasteful number, since it uses less digits than its factorization.
11130113300213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17397235.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 11130113300213 its reverse (31200331103111), we get a palindrome (42330444403324).
The spelling of 11130113300213 in words is "eleven trillion, one hundred thirty billion, one hundred thirteen million, three hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •