Base | Representation |
---|---|
bin | 111010010000100100… |
… | …0110111110011011001 |
3 | 102221221010120210120200 |
4 | 1310201020313303121 |
5 | 4022211131303213 |
6 | 133250314012413 |
7 | 12016225445511 |
oct | 1644110676331 |
9 | 387833523520 |
10 | 125110025433 |
11 | 49071390938 |
12 | 202b7117109 |
13 | ba4aa89a63 |
14 | 60abc88841 |
15 | 33c38e2273 |
hex | 1d21237cd9 |
125110025433 has 12 divisors (see below), whose sum is σ = 181044862128. Its totient is φ = 83254200120.
The previous prime is 125110025431. The next prime is 125110025441. The reversal of 125110025433 is 334520011521.
125110025433 is a `hidden beast` number, since 1 + 2 + 5 + 110 + 0 + 2 + 543 + 3 = 666.
It is not a de Polignac number, because 125110025433 - 21 = 125110025431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125110025397 and 125110025406.
It is not an unprimeable number, because it can be changed into a prime (125110025431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12701763 + ... + 12711608.
It is an arithmetic number, because the mean of its divisors is an integer number (15087071844).
Almost surely, 2125110025433 is an apocalyptic number.
It is an amenable number.
125110025433 is a deficient number, since it is larger than the sum of its proper divisors (55934836695).
125110025433 is a wasteful number, since it uses less digits than its factorization.
125110025433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25413924 (or 25413921 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 125110025433 its reverse (334520011521), we get a palindrome (459630036954).
The spelling of 125110025433 in words is "one hundred twenty-five billion, one hundred ten million, twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •