Base | Representation |
---|---|
bin | 1100010010001100001010… |
… | …0110011000010010111000 |
3 | 1202211020000002211210101200 |
4 | 3010203002212120102320 |
5 | 3232243100324111022 |
6 | 44420510553214200 |
7 | 2562552115614315 |
oct | 304430246302270 |
9 | 52736002753350 |
10 | 13506642019512 |
11 | 4338153336814 |
12 | 1621817101360 |
13 | 76c894bc0645 |
14 | 349a2141bd0c |
15 | 186513470bac |
hex | c48c29984b8 |
13506642019512 has 96 divisors (see below), whose sum is σ = 36917915034000. Its totient is φ = 4460688714240.
The previous prime is 13506642019489. The next prime is 13506642019517. The reversal of 13506642019512 is 21591024660531.
It is a happy number.
13506642019512 is a `hidden beast` number, since 1 + 3 + 50 + 6 + 64 + 20 + 1 + 9 + 512 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13506642019517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 259672164 + ... + 259724172.
Almost surely, 213506642019512 is an apocalyptic number.
13506642019512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13506642019512 is an abundant number, since it is smaller than the sum of its proper divisors (23411273014488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13506642019512 is a wasteful number, since it uses less digits than its factorization.
13506642019512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85221 (or 85214 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 45.
The spelling of 13506642019512 in words is "thirteen trillion, five hundred six billion, six hundred forty-two million, nineteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •