Base | Representation |
---|---|
bin | 111010010000011001… |
… | …0001101100011110100 |
3 | 102221220201102000011101 |
4 | 1310200302031203310 |
5 | 4022203121211421 |
6 | 133245542415444 |
7 | 12016124115244 |
oct | 1644062154364 |
9 | 387821360141 |
10 | 125104085236 |
11 | 49068aa3989 |
12 | 202b5131584 |
13 | ba4978a050 |
14 | 60ab17db24 |
15 | 33c311c191 |
hex | 1d20c8d8f4 |
125104085236 has 12 divisors (see below), whose sum is σ = 235773083812. Its totient is φ = 57740347008.
The previous prime is 125104085179. The next prime is 125104085237. The reversal of 125104085236 is 632580401521.
It can be written as a sum of positive squares in 2 ways, for example, as 50742067600 + 74362017636 = 225260^2 + 272694^2 .
It is a super-3 number, since 3×1251040852363 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125104085195 and 125104085204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125104085237) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1202923845 + ... + 1202923948.
Almost surely, 2125104085236 is an apocalyptic number.
It is an amenable number.
125104085236 is a deficient number, since it is larger than the sum of its proper divisors (110668998576).
125104085236 is a wasteful number, since it uses less digits than its factorization.
125104085236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2405847810 (or 2405847808 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 37.
Adding to 125104085236 its reverse (632580401521), we get a palindrome (757684486757).
The spelling of 125104085236 in words is "one hundred twenty-five billion, one hundred four million, eighty-five thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •