Base | Representation |
---|---|
bin | 111010001110100001… |
… | …0110011010000101100 |
3 | 102221202100022110102220 |
4 | 1310131002303100230 |
5 | 4022041034400400 |
6 | 133235421315340 |
7 | 12014432504136 |
oct | 1643502632054 |
9 | 387670273386 |
10 | 125041325100 |
11 | 490366282aa |
12 | 20298105b50 |
13 | ba39784983 |
14 | 60a2ac4056 |
15 | 33bc8717a0 |
hex | 1d1d0b342c |
125041325100 has 36 divisors (see below), whose sum is σ = 361786234824. Its totient is φ = 33344353280.
The previous prime is 125041325089. The next prime is 125041325111. The reversal of 125041325100 is 1523140521.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (125041325089) and next prime (125041325111).
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 11 ways as a sum of consecutive naturals, for example, 208401909 + ... + 208402508.
It is an arithmetic number, because the mean of its divisors is an integer number (10049617634).
Almost surely, 2125041325100 is an apocalyptic number.
125041325100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125041325100 is an abundant number, since it is smaller than the sum of its proper divisors (236744909724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125041325100 is a wasteful number, since it uses less digits than its factorization.
125041325100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416804434 (or 416804427 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 125041325100 its reverse (1523140521), we get a palindrome (126564465621).
The spelling of 125041325100 in words is "one hundred twenty-five billion, forty-one million, three hundred twenty-five thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •