Base | Representation |
---|---|
bin | 1010000000011010110011… |
… | …1101101111000111111101 |
3 | 1102221210220010011211201122 |
4 | 2200012230331233013331 |
5 | 2420230214124010023 |
6 | 35222220505320325 |
7 | 2213614401246311 |
oct | 240065475570775 |
9 | 42853803154648 |
10 | 11002313110013 |
11 | 3562066a14785 |
12 | 12983a44960a5 |
13 | 61a68a7094c4 |
14 | 2a072c857b41 |
15 | 1412de7ba2c8 |
hex | a01acf6f1fd |
11002313110013 has 8 divisors (see below), whose sum is σ = 11004423021888. Its totient is φ = 11000203419744.
The previous prime is 11002313110003. The next prime is 11002313110031. The reversal of 11002313110013 is 31001131320011.
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 11002313110013 - 216 = 11002313044477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11002313109973 and 11002313110000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002313110003) 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, 124519256 + ... + 124607582.
It is an arithmetic number, because the mean of its divisors is an integer number (1375552877736).
Almost surely, 211002313110013 is an apocalyptic number.
It is an amenable number.
11002313110013 is a deficient number, since it is larger than the sum of its proper divisors (2109911875).
11002313110013 is an equidigital number, since it uses as much as digits as its factorization.
11002313110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110803.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11002313110013 its reverse (31001131320011), we get a palindrome (42003444430024).
The spelling of 11002313110013 in words is "eleven trillion, two billion, three hundred thirteen million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •