Base | Representation |
---|---|
bin | 1100110100111111010110… |
… | …1111010101110010111011 |
3 | 1211221101011212222101112000 |
4 | 3031033311233111302323 |
5 | 3322042004104220411 |
6 | 45555303522352043 |
7 | 2654005445535612 |
oct | 315176557256273 |
9 | 54841155871460 |
10 | 14104500460731 |
11 | 454875989651a |
12 | 16b96687bb623 |
13 | 7b4082c6bab5 |
14 | 36a9390b8879 |
15 | 196d552b7956 |
hex | cd3f5bd5cbb |
14104500460731 has 32 divisors (see below), whose sum is σ = 21107620485120. Its totient is φ = 9307650969792.
The previous prime is 14104500460717. The next prime is 14104500460751. The reversal of 14104500460731 is 13706400540141.
14104500460731 is a `hidden beast` number, since 1 + 4 + 1 + 0 + 45 + 0 + 0 + 4 + 607 + 3 + 1 = 666.
It is not a de Polignac number, because 14104500460731 - 241 = 11905477205179 is a prime.
It is a super-2 number, since 2×141045004607312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14104500460751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5283966 + ... + 7491948.
It is an arithmetic number, because the mean of its divisors is an integer number (659613140160).
Almost surely, 214104500460731 is an apocalyptic number.
14104500460731 is a deficient number, since it is larger than the sum of its proper divisors (7003120024389).
14104500460731 is a wasteful number, since it uses less digits than its factorization.
14104500460731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2210392 (or 2210386 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The spelling of 14104500460731 in words is "fourteen trillion, one hundred four billion, five hundred million, four hundred sixty thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •