Base | Representation |
---|---|
bin | 1110111010001… |
… | …10010000111110 |
3 | 22201100010112010 |
4 | 13131012100332 |
5 | 224004141400 |
6 | 20224352050 |
7 | 3046030521 |
oct | 735062076 |
9 | 281303463 |
10 | 125068350 |
11 | 64663780 |
12 | 35a75626 |
13 | 1cbacb54 |
14 | 12878bb8 |
15 | aea7450 |
hex | 774643e |
125068350 has 96 divisors (see below), whose sum is σ = 340871040. Its totient is φ = 30096000.
The previous prime is 125068289. The next prime is 125068357. The reversal of 125068350 is 53860521.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125068357) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 377685 + ... + 378015.
It is an arithmetic number, because the mean of its divisors is an integer number (3550740).
Almost surely, 2125068350 is an apocalyptic number.
125068350 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 125068350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170435520).
125068350 is an abundant number, since it is smaller than the sum of its proper divisors (215802690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125068350 is a wasteful number, since it uses less digits than its factorization.
125068350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586 (or 581 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 125068350 is about 11183.3961746868. The cubic root of 125068350 is about 500.0911167278.
The spelling of 125068350 in words is "one hundred twenty-five million, sixty-eight thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •