Base | Representation |
---|---|
bin | 111010010000100101… |
… | …0010110001111011101 |
3 | 102221221011022110012100 |
4 | 1310201022112033131 |
5 | 4022211231143003 |
6 | 133250330155313 |
7 | 12016231646331 |
oct | 1644112261735 |
9 | 387834273170 |
10 | 125110412253 |
11 | 49071625522 |
12 | 202b7282b39 |
13 | ba4ab93b48 |
14 | 60abd497c1 |
15 | 33c396bba3 |
hex | 1d212963dd |
125110412253 has 48 divisors (see below), whose sum is σ = 186974783424. Its totient is φ = 80562988800.
The previous prime is 125110412227. The next prime is 125110412309. The reversal of 125110412253 is 352214011521.
It is a happy number.
It is not a de Polignac number, because 125110412253 - 210 = 125110411229 is a prime.
It is a super-2 number, since 2×1251104122532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125110422253) 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 47 ways as a sum of consecutive naturals, for example, 46629450 + ... + 46632132.
It is an arithmetic number, because the mean of its divisors is an integer number (3895307988).
Almost surely, 2125110412253 is an apocalyptic number.
It is an amenable number.
125110412253 is a deficient number, since it is larger than the sum of its proper divisors (61864371171).
125110412253 is a wasteful number, since it uses less digits than its factorization.
125110412253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4026 (or 4023 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 125110412253 its reverse (352214011521), we get a palindrome (477324423774).
The spelling of 125110412253 in words is "one hundred twenty-five billion, one hundred ten million, four hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •