Base | Representation |
---|---|
bin | 11010010010010010… |
… | …00011111011011101 |
3 | 1100102111020120221212 |
4 | 31021021003323131 |
5 | 212400133422140 |
6 | 10252153234205 |
7 | 1006465066043 |
oct | 151111037335 |
9 | 40374216855 |
10 | 14112014045 |
11 | 5a91956028 |
12 | 289a102965 |
13 | 143b89ab8c |
14 | 97c314393 |
15 | 578dac765 |
hex | 349243edd |
14112014045 has 16 divisors (see below), whose sum is σ = 17396782128. Its totient is φ = 10981532160.
The previous prime is 14112014027. The next prime is 14112014047. The reversal of 14112014045 is 54041021141.
It can be written as a sum of positive squares in 8 ways, for example, as 2155466329 + 11956547716 = 46427^2 + 109346^2 .
It is not a de Polignac number, because 14112014045 - 28 = 14112013789 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14112014045.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14112014047) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 894425 + ... + 910065.
It is an arithmetic number, because the mean of its divisors is an integer number (1087298883).
Almost surely, 214112014045 is an apocalyptic number.
It is an amenable number.
14112014045 is a deficient number, since it is larger than the sum of its proper divisors (3284768083).
14112014045 is a wasteful number, since it uses less digits than its factorization.
14112014045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20560.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 14112014045 its reverse (54041021141), we get a palindrome (68153035186).
It can be divided in two parts, 141120 and 14045, that multiplied together give a square (1982030400 = 445202).
The spelling of 14112014045 in words is "fourteen billion, one hundred twelve million, fourteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •