Base | Representation |
---|---|
bin | 1101010110100010001111… |
… | …1010011010110111011000 |
3 | 1220222110201020121121201201 |
4 | 3111220203322122313120 |
5 | 3411012234442002210 |
6 | 51120133341323544 |
7 | 3043436633203453 |
oct | 325504372326730 |
9 | 56873636547651 |
10 | 14680800734680 |
11 | 4750102318063 |
12 | 17912a25665b4 |
13 | 826516895662 |
14 | 38a7a996849a |
15 | 1a6d346a953a |
hex | d5a23e9add8 |
14680800734680 has 32 divisors (see below), whose sum is σ = 33734605947840. Its totient is φ = 5747377308160.
The previous prime is 14680800734647. The next prime is 14680800734687. The reversal of 14680800734680 is 8643700808641.
It is a super-2 number, since 2×146808007346802 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14680800734687) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3904466401 + ... + 3904470160.
It is an arithmetic number, because the mean of its divisors is an integer number (1054206435870).
Almost surely, 214680800734680 is an apocalyptic number.
14680800734680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14680800734680 is an abundant number, since it is smaller than the sum of its proper divisors (19053805213160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14680800734680 is a wasteful number, since it uses less digits than its factorization.
14680800734680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7808936619 (or 7808936615 counting only the distinct ones).
The product of its (nonzero) digits is 6193152, while the sum is 55.
The spelling of 14680800734680 in words is "fourteen trillion, six hundred eighty billion, eight hundred million, seven hundred thirty-four thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •