Base | Representation |
---|---|
bin | 1110111010101… |
… | …11001011110010 |
3 | 22201110122120210 |
4 | 13131113023302 |
5 | 224013401100 |
6 | 20230044550 |
7 | 3046436541 |
oct | 735271362 |
9 | 281418523 |
10 | 125137650 |
11 | 64700850 |
12 | 35aa9756 |
13 | 1cc05561 |
14 | 12896158 |
15 | aebcc50 |
hex | 77572f2 |
125137650 has 96 divisors (see below), whose sum is σ = 341496000. Its totient is φ = 30073600.
The previous prime is 125137633. The next prime is 125137673. The reversal of 125137650 is 56731521.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 47 ways as a sum of consecutive naturals, for example, 245596 + ... + 246104.
It is an arithmetic number, because the mean of its divisors is an integer number (3557250).
Almost surely, 2125137650 is an apocalyptic number.
125137650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 125137650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170748000).
125137650 is an abundant number, since it is smaller than the sum of its proper divisors (216358350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125137650 is a wasteful number, since it uses less digits than its factorization.
125137650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684 (or 679 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 125137650 is about 11186.4940888555. The cubic root of 125137650 is about 500.1834660055.
The spelling of 125137650 in words is "one hundred twenty-five million, one hundred thirty-seven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •