Base | Representation |
---|---|
bin | 1010000000110111111011… |
… | …1001111101000101110101 |
3 | 1102222120001220121022012220 |
4 | 2200031332321331011311 |
5 | 2420342221324120201 |
6 | 35225552315032553 |
7 | 2214312202262415 |
oct | 240157671750565 |
9 | 42876056538186 |
10 | 11010130301301 |
11 | 356540858124a |
12 | 1299a0643b759 |
13 | 61b335104191 |
14 | 2a0c70b36645 |
15 | 1415eac05036 |
hex | a037ee7d175 |
11010130301301 has 8 divisors (see below), whose sum is σ = 14680205004960. Its totient is φ = 7340071232592.
The previous prime is 11010130301293. The next prime is 11010130301309. The reversal of 11010130301301 is 10310303101011.
It is an interprime number because it is at equal distance from previous prime (11010130301293) and next prime (11010130301309).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11010130301301 - 23 = 11010130301293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010130301309) 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, 2152930 + ... + 5162883.
It is an arithmetic number, because the mean of its divisors is an integer number (1835025625620).
Almost surely, 211010130301301 is an apocalyptic number.
It is an amenable number.
11010130301301 is a deficient number, since it is larger than the sum of its proper divisors (3670074703659).
11010130301301 is an equidigital number, since it uses as much as digits as its factorization.
11010130301301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7817475.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 11010130301301 its reverse (10310303101011), we get a palindrome (21320433402312).
The spelling of 11010130301301 in words is "eleven trillion, ten billion, one hundred thirty million, three hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •