Base | Representation |
---|---|
bin | 1100110100111101100000… |
… | …1001000011111101101001 |
3 | 1211221022220021120211100121 |
4 | 3031033120021003331221 |
5 | 3322034444443340303 |
6 | 45555142343203241 |
7 | 2653660235661631 |
oct | 315173011037551 |
9 | 54838807524317 |
10 | 14104003886953 |
11 | 454852455a272 |
12 | 16b954a446521 |
13 | 7b4004116366 |
14 | 36a8cd1756c1 |
15 | 196d268c99bd |
hex | cd3d8243f69 |
14104003886953 has 8 divisors (see below), whose sum is σ = 14123843228480. Its totient is φ = 14084167734000.
The previous prime is 14104003886933. The next prime is 14104003886963. The reversal of 14104003886953 is 35968830040141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14104003886953 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 14104003886953.
It is not an unprimeable number, because it can be changed into a prime (14104003886933) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 8125828 + ... + 9707578.
It is an arithmetic number, because the mean of its divisors is an integer number (1765480403560).
Almost surely, 214104003886953 is an apocalyptic number.
It is an amenable number.
14104003886953 is a deficient number, since it is larger than the sum of its proper divisors (19839341527).
14104003886953 is a wasteful number, since it uses less digits than its factorization.
14104003886953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594287.
The product of its (nonzero) digits is 2488320, while the sum is 52.
The spelling of 14104003886953 in words is "fourteen trillion, one hundred four billion, three million, eight hundred eighty-six thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •