Base | Representation |
---|---|
bin | 1010000110001011100100… |
… | …1111010101111110101101 |
3 | 1110022021101220200112001222 |
4 | 2201202321033111332231 |
5 | 2423340432121100023 |
6 | 35335511320513125 |
7 | 2224020434055323 |
oct | 241427117257655 |
9 | 43267356615058 |
10 | 11101303300013 |
11 | 35a0044336663 |
12 | 12b361001b7a5 |
13 | 626b04c55824 |
14 | 2a543d735d13 |
15 | 143b85036cc8 |
hex | a18b93d5fad |
11101303300013 has 8 divisors (see below), whose sum is σ = 11262783181440. Its totient is φ = 10940989338720.
The previous prime is 11101303299979. The next prime is 11101303300037. The reversal of 11101303300013 is 31000330310111.
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 11101303300013 - 216 = 11101303234477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101303299964 and 11101303300000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101303300093) 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, 291460853 + ... + 291498938.
It is an arithmetic number, because the mean of its divisors is an integer number (1407847897680).
Almost surely, 211101303300013 is an apocalyptic number.
It is an amenable number.
11101303300013 is a deficient number, since it is larger than the sum of its proper divisors (161479881427).
11101303300013 is a wasteful number, since it uses less digits than its factorization.
11101303300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 582960067.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 11101303300013 its reverse (31000330310111), we get a palindrome (42101633610124).
The spelling of 11101303300013 in words is "eleven trillion, one hundred one billion, three hundred three million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •