Base | Representation |
---|---|
bin | 1011111011000111010110… |
… | …0101110000101010010111 |
3 | 1201102022202021202001120201 |
4 | 2332301311211300222113 |
5 | 3204244204013122221 |
6 | 43514425420041331 |
7 | 2522116204665331 |
oct | 276616545605227 |
9 | 51368667661521 |
10 | 13110213020311 |
11 | 41a5012516150 |
12 | 1578a1b993247 |
13 | 74139834ab34 |
14 | 33477561a451 |
15 | 17b06030b891 |
hex | bec75970a97 |
13110213020311 has 8 divisors (see below), whose sum is σ = 14325927120000. Its totient is φ = 11898478346040.
The previous prime is 13110213020309. The next prime is 13110213020321. The reversal of 13110213020311 is 11302031201131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13110213020311 - 21 = 13110213020309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110213020321) 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, 994849461 + ... + 994862638.
It is an arithmetic number, because the mean of its divisors is an integer number (1790740890000).
Almost surely, 213110213020311 is an apocalyptic number.
13110213020311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13110213020311 is a deficient number, since it is larger than the sum of its proper divisors (1215714099689).
13110213020311 is a wasteful number, since it uses less digits than its factorization.
13110213020311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989712709.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13110213020311 its reverse (11302031201131), we get a palindrome (24412244221442).
The spelling of 13110213020311 in words is "thirteen trillion, one hundred ten billion, two hundred thirteen million, twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •