Base | Representation |
---|---|
bin | 111010011101100010… |
… | …0010000101010000111 |
3 | 110000001110010000121201 |
4 | 1310323010100222013 |
5 | 4024104011233020 |
6 | 133401413323331 |
7 | 12033060045346 |
oct | 1647304205207 |
9 | 400043100551 |
10 | 125545024135 |
11 | 492749908a3 |
12 | 203b8936547 |
13 | bab9c3363b |
14 | 610d95db5d |
15 | 33ebbbaa0a |
hex | 1d3b110a87 |
125545024135 has 8 divisors (see below), whose sum is σ = 153207487440. Its totient is φ = 98733713664.
The previous prime is 125545024117. The next prime is 125545024139. The reversal of 125545024135 is 531420545521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125545024135 - 221 = 125542926983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125545024094 and 125545024103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125545024139) 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 7 ways as a sum of consecutive naturals, for example, 212787882 + ... + 212788471.
It is an arithmetic number, because the mean of its divisors is an integer number (19150935930).
Almost surely, 2125545024135 is an apocalyptic number.
125545024135 is a deficient number, since it is larger than the sum of its proper divisors (27662463305).
125545024135 is an equidigital number, since it uses as much as digits as its factorization.
125545024135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425576417.
The product of its (nonzero) digits is 120000, while the sum is 37.
Adding to 125545024135 its reverse (531420545521), we get a palindrome (656965569656).
The spelling of 125545024135 in words is "one hundred twenty-five billion, five hundred forty-five million, twenty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •