Base | Representation |
---|---|
bin | 1101010101101110100000… |
… | …0110000101001010110000 |
3 | 1220221010212022222211120221 |
4 | 3111123220012011022300 |
5 | 3410300314014203223 |
6 | 51105515251142424 |
7 | 3042435521116126 |
oct | 325335006051260 |
9 | 56833768884527 |
10 | 14666912256688 |
11 | 474522566aa7a |
12 | 178a6672a4a14 |
13 | 825112402843 |
14 | 389c4d201916 |
15 | 1a67c0254b5d |
hex | d56e81852b0 |
14666912256688 has 120 divisors (see below), whose sum is σ = 30423784065696. Its totient is φ = 6847481318400.
The previous prime is 14666912256683. The next prime is 14666912256691. The reversal of 14666912256688 is 88665221966641.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (14666912256683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 637098618 + ... + 637121638.
Almost surely, 214666912256688 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14666912256688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15211892032848).
14666912256688 is an abundant number, since it is smaller than the sum of its proper divisors (15756871809008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14666912256688 is a wasteful number, since it uses less digits than its factorization.
14666912256688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24651 (or 24626 counting only the distinct ones).
The product of its digits is 358318080, while the sum is 70.
The spelling of 14666912256688 in words is "fourteen trillion, six hundred sixty-six billion, nine hundred twelve million, two hundred fifty-six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •