Base | Representation |
---|---|
bin | 1101010010000100101011… |
… | …1101011001010000111011 |
3 | 1220201010212001222200211202 |
4 | 3110201022331121100323 |
5 | 3403233242440232101 |
6 | 51021015141244415 |
7 | 3035054235220043 |
oct | 324411275312073 |
9 | 56633761880752 |
10 | 14604146414651 |
11 | 4720646a15952 |
12 | 177a46b10370b |
13 | 81c21b947b41 |
14 | 386bb729a723 |
15 | 1a4d49cb336b |
hex | d484af5943b |
14604146414651 has 4 divisors (see below), whose sum is σ = 14604428579472. Its totient is φ = 14603864249832.
The previous prime is 14604146414617. The next prime is 14604146414659. The reversal of 14604146414651 is 15641464140641.
14604146414651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14604146414651 - 26 = 14604146414587 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14604146414596 and 14604146414605.
It is not an unprimeable number, because it can be changed into a prime (14604146414659) 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, 141004760 + ... + 141108293.
It is an arithmetic number, because the mean of its divisors is an integer number (3651107144868).
Almost surely, 214604146414651 is an apocalyptic number.
14604146414651 is a deficient number, since it is larger than the sum of its proper divisors (282164821).
14604146414651 is an equidigital number, since it uses as much as digits as its factorization.
14604146414651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282164820.
The product of its (nonzero) digits is 1105920, while the sum is 47.
The spelling of 14604146414651 in words is "fourteen trillion, six hundred four billion, one hundred forty-six million, four hundred fourteen thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •