Base | Representation |
---|---|
bin | 11101100110000000001001… |
… | …110111110010000111010000 |
3 | 122001211200102121011210200220 |
4 | 131212000021313302013100 |
5 | 114024424120231243422 |
6 | 1140452151552313040 |
7 | 36262243425544521 |
oct | 3546001167620720 |
9 | 561750377153626 |
10 | 130154854556112 |
11 | 385204002a3221 |
12 | 12720a71542780 |
13 | 578171c7cb049 |
14 | 241d758590848 |
15 | 100a95e44ee5c |
hex | 766009df21d0 |
130154854556112 has 20 divisors (see below), whose sum is σ = 336233374270080. Its totient is φ = 43384951518688.
The previous prime is 130154854556093. The next prime is 130154854556123. The reversal of 130154854556112 is 211655458451031.
130154854556112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1355779734912 + ... + 1355779735007.
It is an arithmetic number, because the mean of its divisors is an integer number (16811668713504).
Almost surely, 2130154854556112 is an apocalyptic number.
130154854556112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130154854556112 is an abundant number, since it is smaller than the sum of its proper divisors (206078519713968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130154854556112 is a wasteful number, since it uses less digits than its factorization.
130154854556112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2711559469930 (or 2711559469924 counting only the distinct ones).
The product of its (nonzero) digits is 2880000, while the sum is 51.
The spelling of 130154854556112 in words is "one hundred thirty trillion, one hundred fifty-four billion, eight hundred fifty-four million, five hundred fifty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •