Base | Representation |
---|---|
bin | 111010010100100100… |
… | …1111000000111000000 |
3 | 102222021111122011000011 |
4 | 1310221021320013000 |
5 | 4023000043202220 |
6 | 133311520234304 |
7 | 12022450511665 |
oct | 1645111700700 |
9 | 388244564004 |
10 | 125244506560 |
11 | 49130293568 |
12 | 2033416b994 |
13 | ba6c8b40a4 |
14 | 60c1a93a6c |
15 | 33d060865a |
hex | 1d292781c0 |
125244506560 has 112 divisors (see below), whose sum is σ = 301665351456. Its totient is φ = 49523392512.
The previous prime is 125244506557. The next prime is 125244506587. The reversal of 125244506560 is 65605442521.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34856124 + ... + 34859716.
It is an arithmetic number, because the mean of its divisors is an integer number (2693440638).
Almost surely, 2125244506560 is an apocalyptic number.
125244506560 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 125244506560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150832675728).
125244506560 is an abundant number, since it is smaller than the sum of its proper divisors (176420844896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125244506560 is a wasteful number, since it uses less digits than its factorization.
125244506560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4830 (or 4820 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 40.
The spelling of 125244506560 in words is "one hundred twenty-five billion, two hundred forty-four million, five hundred six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •