Base | Representation |
---|---|
bin | 111100110001110110… |
… | …0001101110011001000 |
3 | 110110220021022221101002 |
4 | 1321203230031303020 |
5 | 4114302004212440 |
6 | 135543305514132 |
7 | 12300305622206 |
oct | 1714354156310 |
9 | 413807287332 |
10 | 130521554120 |
11 | 503990184a1 |
12 | 213674a2948 |
13 | c400c65539 |
14 | 6462872076 |
15 | 35dda38115 |
hex | 1e63b0dcc8 |
130521554120 has 64 divisors (see below), whose sum is σ = 310699540800. Its totient is φ = 49209672960.
The previous prime is 130521554087. The next prime is 130521554131. The reversal of 130521554120 is 21455125031.
130521554120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 286166 + ... + 585605.
It is an arithmetic number, because the mean of its divisors is an integer number (4854680325).
Almost surely, 2130521554120 is an apocalyptic number.
130521554120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130521554120 is an abundant number, since it is smaller than the sum of its proper divisors (180177986680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130521554120 is a wasteful number, since it uses less digits than its factorization.
130521554120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 871998 (or 871994 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 29.
Adding to 130521554120 its reverse (21455125031), we get a palindrome (151976679151).
The spelling of 130521554120 in words is "one hundred thirty billion, five hundred twenty-one million, five hundred fifty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •