Base | Representation |
---|---|
bin | 1100011001110111111110… |
… | …1111000110000100011100 |
3 | 1210021211202221220022021120 |
4 | 3012131333233012010130 |
5 | 3241423441014414420 |
6 | 45001303231130540 |
7 | 2605234546023624 |
oct | 306357757060434 |
9 | 53254687808246 |
10 | 13638664216860 |
11 | 4389141433721 |
12 | 1643321073a50 |
13 | 77c174a11b47 |
14 | 3521872bd884 |
15 | 189b8dacdd40 |
hex | c677fbc611c |
13638664216860 has 48 divisors (see below), whose sum is σ = 38212112830752. Its totient is φ = 3634705408000.
The previous prime is 13638664216799. The next prime is 13638664216889. The reversal of 13638664216860 is 6861246683631.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 13638664216794 and 13638664216803.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70894281 + ... + 71086400.
It is an arithmetic number, because the mean of its divisors is an integer number (796085683974).
Almost surely, 213638664216860 is an apocalyptic number.
13638664216860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13638664216860 is an abundant number, since it is smaller than the sum of its proper divisors (24573448613892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13638664216860 is a wasteful number, since it uses less digits than its factorization.
13638664216860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141982294 (or 141982292 counting only the distinct ones).
The product of its (nonzero) digits is 35831808, while the sum is 60.
The spelling of 13638664216860 in words is "thirteen trillion, six hundred thirty-eight billion, six hundred sixty-four million, two hundred sixteen thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •