Base | Representation |
---|---|
bin | 1011111011000110101101… |
… | …0011010011110100011111 |
3 | 1201102022022020221121200221 |
4 | 2332301223103103310133 |
5 | 3204243330321131143 |
6 | 43514400332302211 |
7 | 2522112010562404 |
oct | 276615323236437 |
9 | 51368266847627 |
10 | 13110040411423 |
11 | 41a4a3404157a |
12 | 1578992011967 |
13 | 74136b6641b7 |
14 | 33475a7282ab |
15 | 17b0500b32ed |
hex | bec6b4d3d1f |
13110040411423 has 8 divisors (see below), whose sum is σ = 13800588306800. Its totient is φ = 12419547092928.
The previous prime is 13110040411357. The next prime is 13110040411543. The reversal of 13110040411423 is 32411404001131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13110040411423 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 (13110040417423) 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, 13150686 + ... + 14112427.
It is an arithmetic number, because the mean of its divisors is an integer number (1725073538350).
Almost surely, 213110040411423 is an apocalyptic number.
13110040411423 is a deficient number, since it is larger than the sum of its proper divisors (690547895377).
13110040411423 is a wasteful number, since it uses less digits than its factorization.
13110040411423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27288441.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 13110040411423 its reverse (32411404001131), we get a palindrome (45521444412554).
The spelling of 13110040411423 in words is "thirteen trillion, one hundred ten billion, forty million, four hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •