Base | Representation |
---|---|
bin | 1010001100000000000110… |
… | …0100101011101000111001 |
3 | 1110122211111221012010222221 |
4 | 2203000001210223220321 |
5 | 2432010231040213423 |
6 | 35453450124444041 |
7 | 2234160453255124 |
oct | 243000144535071 |
9 | 43584457163887 |
10 | 11201301101113 |
11 | 36294994aa692 |
12 | 130aa790a9621 |
13 | 633380175436 |
14 | 2aa2083833bb |
15 | 146588e89e5d |
hex | a300192ba39 |
11201301101113 has 8 divisors (see below), whose sum is σ = 11228841714560. Its totient is φ = 11173761237600.
The previous prime is 11201301100993. The next prime is 11201301101171. The reversal of 11201301101113 is 31110110310211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11201301101113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11201301101713) 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, 40601788 + ... + 40876738.
It is an arithmetic number, because the mean of its divisors is an integer number (1403605214320).
Almost surely, 211201301101113 is an apocalyptic number.
It is an amenable number.
11201301101113 is a deficient number, since it is larger than the sum of its proper divisors (27540613447).
11201301101113 is an equidigital number, since it uses as much as digits as its factorization.
11201301101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374967.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 11201301101113 its reverse (31110110310211), we get a palindrome (42311411411324).
The spelling of 11201301101113 in words is "eleven trillion, two hundred one billion, three hundred one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •