Base | Representation |
---|---|
bin | 1100111001110010101101… |
… | …1010111111010101011110 |
3 | 1212020021010210201022220110 |
4 | 3032130223122333111132 |
5 | 3324414441400133032 |
6 | 50101230443230450 |
7 | 2662656135556404 |
oct | 316345332772536 |
9 | 55207123638813 |
10 | 14187005474142 |
11 | 457a747810216 |
12 | 1711653518426 |
13 | 7bbaa1069c67 |
14 | 37092480b474 |
15 | 1990836527cc |
hex | ce72b6bf55e |
14187005474142 has 8 divisors (see below), whose sum is σ = 28374010948296. Its totient is φ = 4729001824712.
The previous prime is 14187005474129. The next prime is 14187005474153. The reversal of 14187005474142 is 24147450078141.
It is a sphenic number, since it is the product of 3 distinct primes.
14187005474142 is an admirable number.
It is a super-3 number, since 3×141870054741423 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 14187005474091 and 14187005474100.
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, 1182250456173 + ... + 1182250456184.
It is an arithmetic number, because the mean of its divisors is an integer number (3546751368537).
Almost surely, 214187005474142 is an apocalyptic number.
14187005474142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14187005474142 is a wasteful number, since it uses less digits than its factorization.
14187005474142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2364500912362.
The product of its (nonzero) digits is 1003520, while the sum is 48.
The spelling of 14187005474142 in words is "fourteen trillion, one hundred eighty-seven billion, five million, four hundred seventy-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •