Base | Representation |
---|---|
bin | 1010001100000111111101… |
… | …1101010101101010011001 |
3 | 1110200000222010022002002102 |
4 | 2203001333131111222121 |
5 | 2432024042223332210 |
6 | 35454435452213145 |
7 | 2234264010066551 |
oct | 243017735255231 |
9 | 43600863262072 |
10 | 11203413105305 |
11 | 362a3826976a3 |
12 | 130b36846a1b5 |
13 | 6336288a7165 |
14 | 2aa368a76161 |
15 | 14665e5c3ea5 |
hex | a307f755a99 |
11203413105305 has 8 divisors (see below), whose sum is σ = 13444166556744. Its totient is φ = 8962683264000.
The previous prime is 11203413105293. The next prime is 11203413105307. The reversal of 11203413105305 is 50350131430211.
It can be written as a sum of positive squares in 4 ways, for example, as 2501550293641 + 8701862811664 = 1581629^2 + 2949892^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11203413105305 - 226 = 11203345996441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11203413105307) 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, 4841246 + ... + 6770855.
It is an arithmetic number, because the mean of its divisors is an integer number (1680520819593).
Almost surely, 211203413105305 is an apocalyptic number.
It is an amenable number.
11203413105305 is a deficient number, since it is larger than the sum of its proper divisors (2240753451439).
11203413105305 is a wasteful number, since it uses less digits than its factorization.
11203413105305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11805067.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 11203413105305 its reverse (50350131430211), we get a palindrome (61553544535516).
The spelling of 11203413105305 in words is "eleven trillion, two hundred three billion, four hundred thirteen million, one hundred five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •