Base | Representation |
---|---|
bin | 1101010001010101100011… |
… | …1111000101011001001000 |
3 | 1220122221012111120120000221 |
4 | 3110111120333011121020 |
5 | 3403031341142233210 |
6 | 51011124025035424 |
7 | 3034125615455011 |
oct | 324253077053110 |
9 | 56587174516027 |
10 | 14591496836680 |
11 | 4716245623785 |
12 | 1777b1a925b74 |
13 | 81ac8404946a |
14 | 3863372ac008 |
15 | 1a48594d01da |
hex | d4558fc5648 |
14591496836680 has 128 divisors (see below), whose sum is σ = 34967083334400. Its totient is φ = 5464255168512.
The previous prime is 14591496836659. The next prime is 14591496836711. The reversal of 14591496836680 is 8663869419541.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49466509 + ... + 49760611.
It is an arithmetic number, because the mean of its divisors is an integer number (273180338550).
Almost surely, 214591496836680 is an apocalyptic number.
14591496836680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14591496836680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17483541667200).
14591496836680 is an abundant number, since it is smaller than the sum of its proper divisors (20375586497720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14591496836680 is a wasteful number, since it uses less digits than its factorization.
14591496836680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294903 (or 294899 counting only the distinct ones).
The product of its (nonzero) digits is 268738560, while the sum is 70.
The spelling of 14591496836680 in words is "fourteen trillion, five hundred ninety-one billion, four hundred ninety-six million, eight hundred thirty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •