Base | Representation |
---|---|
bin | 1100000110110011110111… |
… | …0001011001110001100000 |
3 | 1202010112101020022202101110 |
4 | 3001230331301121301200 |
5 | 3221042203320323404 |
6 | 44151015302503320 |
7 | 2542461313144365 |
oct | 301547561316140 |
9 | 52115336282343 |
10 | 13311140011104 |
11 | 427224a574241 |
12 | 15ab955a34b40 |
13 | 757309723a70 |
14 | 34039688246c |
15 | 1813bed3eb89 |
hex | c1b3dc59c60 |
13311140011104 has 48 divisors (see below), whose sum is σ = 37629568881072. Its totient is φ = 4095735387648.
The previous prime is 13311140011097. The next prime is 13311140011111. The reversal of 13311140011104 is 40111004111331.
It is an interprime number because it is at equal distance from previous prime (13311140011097) and next prime (13311140011111).
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5332987539 + ... + 5332990034.
It is an arithmetic number, because the mean of its divisors is an integer number (783949351689).
Almost surely, 213311140011104 is an apocalyptic number.
It is an amenable number.
13311140011104 is an abundant number, since it is smaller than the sum of its proper divisors (24318428869968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13311140011104 is a wasteful number, since it uses less digits than its factorization.
13311140011104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10665977599 (or 10665977591 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 13311140011104 its reverse (40111004111331), we get a palindrome (53422144122435).
The spelling of 13311140011104 in words is "thirteen trillion, three hundred eleven billion, one hundred forty million, eleven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •