Base | Representation |
---|---|
bin | 1100110100111111001011… |
… | …1010010100000011000001 |
3 | 1211221101001120200102012001 |
4 | 3031033302322110003001 |
5 | 3322041404432134010 |
6 | 45555255105304001 |
7 | 2654004331300312 |
oct | 315176272240301 |
9 | 54841046612161 |
10 | 14104453005505 |
11 | 4548735023725 |
12 | 16b9654935001 |
13 | 7b4076194a95 |
14 | 36a932a84609 |
15 | 196d51041c3a |
hex | cd3f2e940c1 |
14104453005505 has 4 divisors (see below), whose sum is σ = 16925343606612. Its totient is φ = 11283562404400.
The previous prime is 14104453005499. The next prime is 14104453005509. The reversal of 14104453005505 is 50550035440141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6072222499344 + 8032230506161 = 2464188^2 + 2834119^2 .
It is not a de Polignac number, because 14104453005505 - 211 = 14104453003457 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14104453005509) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1410445300546 + ... + 1410445300555.
It is an arithmetic number, because the mean of its divisors is an integer number (4231335901653).
Almost surely, 214104453005505 is an apocalyptic number.
It is an amenable number.
14104453005505 is a deficient number, since it is larger than the sum of its proper divisors (2820890601107).
14104453005505 is an equidigital number, since it uses as much as digits as its factorization.
14104453005505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2820890601106.
The product of its (nonzero) digits is 120000, while the sum is 37.
Adding to 14104453005505 its reverse (50550035440141), we get a palindrome (64654488445646).
The spelling of 14104453005505 in words is "fourteen trillion, one hundred four billion, four hundred fifty-three million, five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •