Base | Representation |
---|---|
bin | 1011111100100010011010… |
… | …1010110101010100011100 |
3 | 1201111122211221200222201002 |
4 | 2333020212222311110130 |
5 | 3210144240120110240 |
6 | 43533551241005432 |
7 | 2523643042205402 |
oct | 277104652652434 |
9 | 51448757628632 |
10 | 13134658753820 |
11 | 42044174a059a |
12 | 1581702783878 |
13 | 743792aabbc6 |
14 | 335a14123472 |
15 | 17b9e14e6d15 |
hex | bf226ab551c |
13134658753820 has 12 divisors (see below), whose sum is σ = 27582783383064. Its totient is φ = 5253863501520.
The previous prime is 13134658753807. The next prime is 13134658753829. The reversal of 13134658753820 is 2835785643131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13134658753829) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 328366468826 + ... + 328366468865.
It is an arithmetic number, because the mean of its divisors is an integer number (2298565281922).
Almost surely, 213134658753820 is an apocalyptic number.
13134658753820 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13134658753820 is an abundant number, since it is smaller than the sum of its proper divisors (14448124629244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13134658753820 is a wasteful number, since it uses less digits than its factorization.
13134658753820 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 656732937700 (or 656732937698 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 56.
The spelling of 13134658753820 in words is "thirteen trillion, one hundred thirty-four billion, six hundred fifty-eight million, seven hundred fifty-three thousand, eight hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •