Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0101101110110011010101 |
3 | 1201102100001110201021020011 |
4 | 2332301330211232303111 |
5 | 3204244424044000310 |
6 | 43514445213040221 |
7 | 2522122132105306 |
oct | 276617445566325 |
9 | 51370043637204 |
10 | 13110330453205 |
11 | 41a5072834227 |
12 | 1578a53186071 |
13 | 7413b678645b |
14 | 3347870687ad |
15 | 17b06a7a678a |
hex | bec7c96ecd5 |
13110330453205 has 4 divisors (see below), whose sum is σ = 15732396543852. Its totient is φ = 10488264362560.
The previous prime is 13110330453193. The next prime is 13110330453229. The reversal of 13110330453205 is 50235403301131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6347532563761 + 6762797889444 = 2519431^2 + 2600538^2 .
It is not a de Polignac number, because 13110330453205 - 225 = 13110296898773 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1311033045316 + ... + 1311033045325.
It is an arithmetic number, because the mean of its divisors is an integer number (3933099135963).
Almost surely, 213110330453205 is an apocalyptic number.
It is an amenable number.
13110330453205 is a deficient number, since it is larger than the sum of its proper divisors (2622066090647).
13110330453205 is an equidigital number, since it uses as much as digits as its factorization.
13110330453205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622066090646.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 13110330453205 its reverse (50235403301131), we get a palindrome (63345733754336).
The spelling of 13110330453205 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, four hundred fifty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •