Base | Representation |
---|---|
bin | 1100110001010111101110… |
… | …0101100000010111101001 |
3 | 1211201102200112022221011010 |
4 | 3030111323211200113221 |
5 | 3320032133302120410 |
6 | 45510541540054133 |
7 | 2646344550342414 |
oct | 314257345402751 |
9 | 54642615287133 |
10 | 14042321520105 |
11 | 452435146308a |
12 | 16a95b5094349 |
13 | 7ab253c74938 |
14 | 36791b0aab7b |
15 | 195416607c20 |
hex | cc57b9605e9 |
14042321520105 has 16 divisors (see below), whose sum is σ = 22468944697920. Its totient is φ = 7488828055488.
The previous prime is 14042321520067. The next prime is 14042321520119. The reversal of 14042321520105 is 50102512324041.
It is not a de Polignac number, because 14042321520105 - 212 = 14042321516009 is a prime.
It is a super-2 number, since 2×140423215201052 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 25347367 + ... + 25895436.
It is an arithmetic number, because the mean of its divisors is an integer number (1404309043620).
Almost surely, 214042321520105 is an apocalyptic number.
14042321520105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14042321520105 is a deficient number, since it is larger than the sum of its proper divisors (8426623177815).
14042321520105 is a wasteful number, since it uses less digits than its factorization.
14042321520105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51261080.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 14042321520105 its reverse (50102512324041), we get a palindrome (64144833844146).
The spelling of 14042321520105 in words is "fourteen trillion, forty-two billion, three hundred twenty-one million, five hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •