Base | Representation |
---|---|
bin | 111010100001001100… |
… | …0011001110100111000 |
3 | 110000101000000220002220 |
4 | 1311002120121310320 |
5 | 4024331420320310 |
6 | 133421515524040 |
7 | 12036110131353 |
oct | 1650230316470 |
9 | 400330026086 |
10 | 125667745080 |
11 | 49328190969 |
12 | 20431a59620 |
13 | bb094a0b97 |
14 | 6121d8729a |
15 | 340785c670 |
hex | 1d42619d38 |
125667745080 has 128 divisors (see below), whose sum is σ = 395346657600. Its totient is φ = 31912538112.
The previous prime is 125667745067. The next prime is 125667745081. The reversal of 125667745080 is 80547766521.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125667745081) 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 31 ways as a sum of consecutive naturals, for example, 6702 + ... + 501378.
Almost surely, 2125667745080 is an apocalyptic number.
125667745080 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 125667745080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197673328800).
125667745080 is an abundant number, since it is smaller than the sum of its proper divisors (269678912520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125667745080 is a wasteful number, since it uses less digits than its factorization.
125667745080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494793 (or 494789 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 125667745080 in words is "one hundred twenty-five billion, six hundred sixty-seven million, seven hundred forty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •