Base | Representation |
---|---|
bin | 111010001110110100… |
… | …0100100010011010100 |
3 | 102221210000221102221222 |
4 | 1310131220210103110 |
5 | 4022101103202200 |
6 | 133240413425512 |
7 | 12014612606531 |
oct | 1643550442324 |
9 | 387700842858 |
10 | 125051225300 |
11 | 4904117a491 |
12 | 2029b49b298 |
13 | ba3b83cc91 |
14 | 60a413dd88 |
15 | 33bd679d85 |
hex | 1d1da244d4 |
125051225300 has 36 divisors (see below), whose sum is σ = 271380414396. Its totient is φ = 50016940800.
The previous prime is 125051225279. The next prime is 125051225311. The reversal of 125051225300 is 3522150521.
It can be written as a sum of positive squares in 6 ways, for example, as 573506704 + 124477718596 = 23948^2 + 352814^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 125051225300.
It is a congruent number.
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, 1721720 + ... + 1792880.
Almost surely, 2125051225300 is an apocalyptic number.
125051225300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125051225300 is an abundant number, since it is smaller than the sum of its proper divisors (146329189096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125051225300 is a wasteful number, since it uses less digits than its factorization.
125051225300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88748 (or 88741 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 125051225300 its reverse (3522150521), we get a palindrome (128573375821).
The spelling of 125051225300 in words is "one hundred twenty-five billion, fifty-one million, two hundred twenty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •