Base | Representation |
---|---|
bin | 1110111001111… |
… | …01100111000000 |
3 | 22201021022220000 |
4 | 13130331213000 |
5 | 224002023041 |
6 | 20223520000 |
7 | 3045522252 |
oct | 734754700 |
9 | 281238800 |
10 | 125032896 |
11 | 6463a07a |
12 | 35a59000 |
13 | 1cb99981 |
14 | 12869cd2 |
15 | ae9bbb6 |
hex | 773d9c0 |
125032896 has 140 divisors (see below), whose sum is σ = 376184160. Its totient is φ = 41057280.
The previous prime is 125032877. The next prime is 125032931. The reversal of 125032896 is 698230521.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 125032896.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 461241 + ... + 461511.
Almost surely, 2125032896 is an apocalyptic number.
125032896 is a gapful number since it is divisible by the number (16) 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 125032896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188092080).
125032896 is an abundant number, since it is smaller than the sum of its proper divisors (251151264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125032896 is an equidigital number, since it uses as much as digits as its factorization.
125032896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384 (or 365 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 125032896 is about 11181.8109445653. The cubic root of 125032896 is about 500.0438574863.
The spelling of 125032896 in words is "one hundred twenty-five million, thirty-two thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •