Base | Representation |
---|---|
bin | 1100011100101101100111… |
… | …0000100100001001110000 |
3 | 1210110111121202222122202121 |
4 | 3013023121300210021300 |
5 | 3243223313303120140 |
6 | 45035525155324024 |
7 | 2611612002334225 |
oct | 307133160441160 |
9 | 53414552878677 |
10 | 13687419191920 |
11 | 43a7890338041 |
12 | 1650868bb0614 |
13 | 783944854606 |
14 | 35469051d94c |
15 | 18b093ee264a |
hex | c72d9c24270 |
13687419191920 has 40 divisors (see below), whose sum is σ = 32259184561296. Its totient is φ = 5399968117248.
The previous prime is 13687419191917. The next prime is 13687419191951. The reversal of 13687419191920 is 2919191478631.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1171862242 + ... + 1171873921.
Almost surely, 213687419191920 is an apocalyptic number.
13687419191920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13687419191920 is an abundant number, since it is smaller than the sum of its proper divisors (18571765369376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13687419191920 is a wasteful number, since it uses less digits than its factorization.
13687419191920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2343736249 (or 2343736243 counting only the distinct ones).
The product of its (nonzero) digits is 5878656, while the sum is 61.
The spelling of 13687419191920 in words is "thirteen trillion, six hundred eighty-seven billion, four hundred nineteen million, one hundred ninety-one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •