Base | Representation |
---|---|
bin | 1100110100100000011000… |
… | …1110101101101111101111 |
3 | 1211220120201112002021200210 |
4 | 3031020012032231233233 |
5 | 3321422442404424114 |
6 | 45551410552153503 |
7 | 2653262442060531 |
oct | 315100616555757 |
9 | 54816645067623 |
10 | 14096187186159 |
11 | 45451831a8271 |
12 | 16b7b28698893 |
13 | 7b3359860a10 |
14 | 36a38ad83851 |
15 | 196a1a53a259 |
hex | cd2063adbef |
14096187186159 has 8 divisors (see below), whose sum is σ = 20240679036592. Its totient is φ = 8674576729920.
The previous prime is 14096187186139. The next prime is 14096187186209. The reversal of 14096187186159 is 95168178169041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14096187186159 - 27 = 14096187186031 is a prime.
It is a super-2 number, since 2×140961871861592 (a number of 27 digits) contains 22 as substring.
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 14096187186159.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14096187186139) 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, 180720348502 + ... + 180720348579.
It is an arithmetic number, because the mean of its divisors is an integer number (2530084879574).
Almost surely, 214096187186159 is an apocalyptic number.
14096187186159 is a deficient number, since it is larger than the sum of its proper divisors (6144491850433).
14096187186159 is a wasteful number, since it uses less digits than its factorization.
14096187186159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361440697097.
The product of its (nonzero) digits is 26127360, while the sum is 66.
The spelling of 14096187186159 in words is "fourteen trillion, ninety-six billion, one hundred eighty-seven million, one hundred eighty-six thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •