Base | Representation |
---|---|
bin | 1110111010111… |
… | …10111100000000 |
3 | 22201112021011000 |
4 | 13131132330000 |
5 | 224020410113 |
6 | 20230452000 |
7 | 3046631250 |
oct | 735367400 |
9 | 281467130 |
10 | 125169408 |
11 | 647226a1 |
12 | 35b04000 |
13 | 1cc16b50 |
14 | 128a3960 |
15 | aec7373 |
hex | 775ef00 |
125169408 has 288 divisors, whose sum is σ = 457856000. Its totient is φ = 32845824.
The previous prime is 125169403. The next prime is 125169439. The reversal of 125169408 is 804961521.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125169403) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 628893 + ... + 629091.
Almost surely, 2125169408 is an apocalyptic number.
125169408 is a gapful number since it is divisible by the number (18) 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 125169408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228928000).
125169408 is an abundant number, since it is smaller than the sum of its proper divisors (332686592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125169408 is a wasteful number, since it uses less digits than its factorization.
125169408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244 (or 224 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 125169408 is about 11187.9134783927. The cubic root of 125169408 is about 500.2257753690.
The spelling of 125169408 in words is "one hundred twenty-five million, one hundred sixty-nine thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •