Base | Representation |
---|---|
bin | 1011111011001000001100… |
… | …1101000000011000100111 |
3 | 1201102100100012111120021011 |
4 | 2332302003031000120213 |
5 | 3204300141000142020 |
6 | 43514504215203051 |
7 | 2522124650202604 |
oct | 276620315003047 |
9 | 51370305446234 |
10 | 13110441412135 |
11 | 41a511a430321 |
12 | 1578a84376487 |
13 | 741403766122 |
14 | 334797aad6ab |
15 | 17b0753c335a |
hex | bec83340627 |
13110441412135 has 8 divisors (see below), whose sum is σ = 15761291178096. Its totient is φ = 10469178807360.
The previous prime is 13110441412127. The next prime is 13110441412139. The reversal of 13110441412135 is 53121414401131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13110441412135 - 23 = 13110441412127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13110441412097 and 13110441412106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110441412139) 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, 2396787286 + ... + 2396792755.
It is an arithmetic number, because the mean of its divisors is an integer number (1970161397262).
Almost surely, 213110441412135 is an apocalyptic number.
13110441412135 is a deficient number, since it is larger than the sum of its proper divisors (2650849765961).
13110441412135 is an equidigital number, since it uses as much as digits as its factorization.
13110441412135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4793580593.
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 13110441412135 its reverse (53121414401131), we get a palindrome (66231855813266).
The spelling of 13110441412135 in words is "thirteen trillion, one hundred ten billion, four hundred forty-one million, four hundred twelve thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •