Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1101110011001011100001 |
3 | 1110022100020212111211001000 |
4 | 2201203203331303023201 |
5 | 2423343414122340223 |
6 | 35340110404502213 |
7 | 2224044256666332 |
oct | 241434375631341 |
9 | 43270225454030 |
10 | 11102020121313 |
11 | 35a0381a25060 |
12 | 12b37900aa969 |
13 | 626bba604544 |
14 | 2a54aaa0c289 |
15 | 143bc7e2d543 |
hex | a18e3f732e1 |
11102020121313 has 32 divisors (see below), whose sum is σ = 17943197368320. Its totient is φ = 6728295073680.
The previous prime is 11102020121293. The next prime is 11102020121317. The reversal of 11102020121313 is 31312102020111.
11102020121313 is a `hidden beast` number, since 1 + 110 + 20 + 201 + 21 + 313 = 666.
It is not a de Polignac number, because 11102020121313 - 29 = 11102020120801 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11102020121317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9663156 + ... + 10750842.
It is an arithmetic number, because the mean of its divisors is an integer number (560724917760).
Almost surely, 211102020121313 is an apocalyptic number.
It is an amenable number.
11102020121313 is a deficient number, since it is larger than the sum of its proper divisors (6841177247007).
11102020121313 is a wasteful number, since it uses less digits than its factorization.
11102020121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122074 (or 1122068 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11102020121313 its reverse (31312102020111), we get a palindrome (42414122141424).
The spelling of 11102020121313 in words is "eleven trillion, one hundred two billion, twenty million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •