Base | Representation |
---|---|
bin | 1100110101110101010110… |
… | …1101001111011011000001 |
3 | 1211222202121001210212101001 |
4 | 3031131111231033123001 |
5 | 3322311200312044321 |
6 | 50010102120012001 |
7 | 2655030603645550 |
oct | 315352555173301 |
9 | 54882531725331 |
10 | 14118995424961 |
11 | 45539179216a9 |
12 | 1700433001001 |
13 | 7b5552c8b8cb |
14 | 36b5121d5d97 |
15 | 197402abbc91 |
hex | cd755b4f6c1 |
14118995424961 has 8 divisors (see below), whose sum is σ = 16136130386304. Its totient is φ = 12101894367360.
The previous prime is 14118995424949. The next prime is 14118995425019. The reversal of 14118995424961 is 16942459981141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14118995424961 - 217 = 14118995293889 is a prime.
It is a super-3 number, since 3×141189954249613 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14118995424893 and 14118995424902.
It is not an unprimeable number, because it can be changed into a prime (14118995424461) 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, 7577200 + ... + 9254833.
It is an arithmetic number, because the mean of its divisors is an integer number (2017016298288).
Almost surely, 214118995424961 is an apocalyptic number.
It is an amenable number.
14118995424961 is a deficient number, since it is larger than the sum of its proper divisors (2017134961343).
14118995424961 is a wasteful number, since it uses less digits than its factorization.
14118995424961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16951871.
The product of its digits is 22394880, while the sum is 64.
The spelling of 14118995424961 in words is "fourteen trillion, one hundred eighteen billion, nine hundred ninety-five million, four hundred twenty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •