Base | Representation |
---|---|
bin | 1011111011001111101001… |
… | …1001101010111111110001 |
3 | 1201102112111120111101110001 |
4 | 2332303322121222333301 |
5 | 3204313234423033410 |
6 | 43515434454110001 |
7 | 2522225342250502 |
oct | 276637231527761 |
9 | 51375446441401 |
10 | 13112441221105 |
11 | 41a5a56257406 |
12 | 157934204b301 |
13 | 741661b74545 |
14 | 334907518ba9 |
15 | 17b140c4933a |
hex | becfa66aff1 |
13112441221105 has 24 divisors (see below), whose sum is σ = 16003340750592. Its totient is φ = 10313966376000.
The previous prime is 13112441221069. The next prime is 13112441221151. The reversal of 13112441221105 is 50112214421131.
It is not a de Polignac number, because 13112441221105 - 217 = 13112441090033 is a prime.
It is a super-2 number, since 2×131124412211052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48069550 + ... + 48341560.
It is an arithmetic number, because the mean of its divisors is an integer number (666805864608).
Almost surely, 213112441221105 is an apocalyptic number.
It is an amenable number.
13112441221105 is a deficient number, since it is larger than the sum of its proper divisors (2890899529487).
13112441221105 is an equidigital number, since it uses as much as digits as its factorization.
13112441221105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274729 (or 274668 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 28.
Adding to 13112441221105 its reverse (50112214421131), we get a palindrome (63224655642236).
The spelling of 13112441221105 in words is "thirteen trillion, one hundred twelve billion, four hundred forty-one million, two hundred twenty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •