Base | Representation |
---|---|
bin | 1010000110110000111001… |
… | …1001110001000011011101 |
3 | 1110100020021010200202022201 |
4 | 2201230032121301003131 |
5 | 2424021441414432201 |
6 | 35344245413011501 |
7 | 2224523626630453 |
oct | 241541631610335 |
9 | 43306233622281 |
10 | 11111322030301 |
11 | 35a4315683a49 |
12 | 12b5547323b91 |
13 | 627a407a04bc |
14 | 2a5b101729d3 |
15 | 14406e894801 |
hex | a1b0e6710dd |
11111322030301 has 8 divisors (see below), whose sum is σ = 11964334789440. Its totient is φ = 10280465446848.
The previous prime is 11111322030203. The next prime is 11111322030317. The reversal of 11111322030301 is 10303022311111.
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 11111322030301 - 29 = 11111322029789 is a prime.
It is a super-2 number, since 2×111113220303012 (a number of 27 digits) contains 22 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 (11111322030101) 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, 5539042881 + ... + 5539044886.
It is an arithmetic number, because the mean of its divisors is an integer number (1495541848680).
Almost surely, 211111322030301 is an apocalyptic number.
It is an amenable number.
11111322030301 is a deficient number, since it is larger than the sum of its proper divisors (853012759139).
11111322030301 is a wasteful number, since it uses less digits than its factorization.
11111322030301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11078087843.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11111322030301 its reverse (10303022311111), we get a palindrome (21414344341412).
The spelling of 11111322030301 in words is "eleven trillion, one hundred eleven billion, three hundred twenty-two million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •