Base | Representation |
---|---|
bin | 1011111011000111101100… |
… | …0101011100110110000000 |
3 | 1201102022222201012222022021 |
4 | 2332301323011130312000 |
5 | 3204244401113320244 |
6 | 43514442512051224 |
7 | 2522121404425150 |
oct | 276617305346600 |
9 | 51368881188267 |
10 | 13110305213824 |
11 | 41a505a565535 |
12 | 1578a46833b14 |
13 | 7413b148a300 |
14 | 334783978760 |
15 | 17b06846d284 |
hex | bec7b15cd80 |
13110305213824 has 96 divisors (see below), whose sum is σ = 32322083678640. Its totient is φ = 5186494310400.
The previous prime is 13110305213779. The next prime is 13110305213867. The reversal of 13110305213824 is 42831250301131.
It is a self number, because there is not a number n which added to its sum of digits gives 13110305213824.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 43138627 + ... + 43441474.
Almost surely, 213110305213824 is an apocalyptic number.
13110305213824 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13110305213824 is an abundant number, since it is smaller than the sum of its proper divisors (19211778464816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110305213824 is an equidigital number, since it uses as much as digits as its factorization.
13110305213824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86580148 (or 86580123 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 13110305213824 its reverse (42831250301131), we get a palindrome (55941555514955).
The spelling of 13110305213824 in words is "thirteen trillion, one hundred ten billion, three hundred five million, two hundred thirteen thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •