Base | Representation |
---|---|
bin | 111010011101111000… |
… | …1001001100110000000 |
3 | 110000002021020212122201 |
4 | 1310323301021212000 |
5 | 4024120014313210 |
6 | 133402513442544 |
7 | 12033262056145 |
oct | 1647361114600 |
9 | 400067225581 |
10 | 125556791680 |
11 | 49280598a41 |
12 | 20400870454 |
13 | babc4c3898 |
14 | 61113443cc |
15 | 33ecc4253a |
hex | 1d3bc49980 |
125556791680 has 64 divisors (see below), whose sum is σ = 300771280080. Its totient is φ = 50120304640.
The previous prime is 125556791623. The next prime is 125556791699. The reversal of 125556791680 is 86197655521.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 114462 + ... + 514018.
Almost surely, 2125556791680 is an apocalyptic number.
125556791680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125556791680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150385640040).
125556791680 is an abundant number, since it is smaller than the sum of its proper divisors (175214488400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125556791680 is an equidigital number, since it uses as much as digits as its factorization.
125556791680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400067 (or 400055 counting only the distinct ones).
The product of its (nonzero) digits is 4536000, while the sum is 55.
The spelling of 125556791680 in words is "one hundred twenty-five billion, five hundred fifty-six million, seven hundred ninety-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •