Base | Representation |
---|---|
bin | 1011111010100110010001… |
… | …0000000111101001001011 |
3 | 1201101110211100220122101100 |
4 | 2332221210100013221023 |
5 | 3204123012020400021 |
6 | 43510400253152443 |
7 | 2521353140161056 |
oct | 276514420075113 |
9 | 51343740818340 |
10 | 13101332200011 |
11 | 41a1275526440 |
12 | 157716178b723 |
13 | 7405b1498293 |
14 | 334171d89a9d |
15 | 17abe0822626 |
hex | bea64407a4b |
13101332200011 has 48 divisors (see below), whose sum is σ = 20750943058560. Its totient is φ = 7899301872000.
The previous prime is 13101332199997. The next prime is 13101332200111. The reversal of 13101332200011 is 11000223310131.
13101332200011 is a `hidden beast` number, since 1 + 310 + 1 + 332 + 20 + 0 + 0 + 1 + 1 = 666.
It is not a de Polignac number, because 13101332200011 - 29 = 13101332199499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13101332200111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 50861580 + ... + 51118518.
It is an arithmetic number, because the mean of its divisors is an integer number (432311313720).
Almost surely, 213101332200011 is an apocalyptic number.
13101332200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13101332200011 is a deficient number, since it is larger than the sum of its proper divisors (7649610858549).
13101332200011 is a wasteful number, since it uses less digits than its factorization.
13101332200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259608 (or 259605 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13101332200011 its reverse (11000223310131), we get a palindrome (24101555510142).
The spelling of 13101332200011 in words is "thirteen trillion, one hundred one billion, three hundred thirty-two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •