Base | Representation |
---|---|
bin | 1010000001000011110111… |
… | …0100011101111101000101 |
3 | 1102222212100010122001220220 |
4 | 2200100331310131331011 |
5 | 2420420301311430201 |
6 | 35231242214414553 |
7 | 2214454444360116 |
oct | 240207564357505 |
9 | 42885303561826 |
10 | 11013333311301 |
11 | 35668015a0052 |
12 | 129a55b061459 |
13 | 61b725887a79 |
14 | 2a10962a620d |
15 | 141736eea036 |
hex | a043dd1df45 |
11013333311301 has 8 divisors (see below), whose sum is σ = 14684477625120. Its totient is φ = 7342205602512.
The previous prime is 11013333311263. The next prime is 11013333311359. The reversal of 11013333311301 is 10311333331011.
11013333311301 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 not a de Polignac number, because 11013333311301 - 233 = 11004743376709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013333311401) 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, 2511090 + ... + 5322803.
It is an arithmetic number, because the mean of its divisors is an integer number (1835559703140).
Almost surely, 211013333311301 is an apocalyptic number.
It is an amenable number.
11013333311301 is a deficient number, since it is larger than the sum of its proper divisors (3671144313819).
11013333311301 is an equidigital number, since it uses as much as digits as its factorization.
11013333311301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8302515.
The product of its (nonzero) digits is 729, while the sum is 24.
Adding to 11013333311301 its reverse (10311333331011), we get a palindrome (21324666642312).
The spelling of 11013333311301 in words is "eleven trillion, thirteen billion, three hundred thirty-three million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •