Base | Representation |
---|---|
bin | 111010001101101010… |
… | …1011010100000111001 |
3 | 102221200100100121122200 |
4 | 1310123111122200321 |
5 | 4022011214300131 |
6 | 133232514540413 |
7 | 12013633664316 |
oct | 1643325324071 |
9 | 387610317580 |
10 | 125012650041 |
11 | 49021422304 |
12 | 2028a597709 |
13 | ba33854a96 |
14 | 609cd7bd0d |
15 | 33ba0aa2e6 |
hex | 1d1b55a839 |
125012650041 has 12 divisors (see below), whose sum is σ = 181094218032. Its totient is φ = 83101586616.
The previous prime is 125012650031. The next prime is 125012650043. The reversal of 125012650041 is 140056210521.
125012650041 is a `hidden beast` number, since 1 + 2 + 5 + 0 + 1 + 2 + 650 + 0 + 4 + 1 = 666.
It is not a de Polignac number, because 125012650041 - 26 = 125012649977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125012649987 and 125012650014.
It is not an unprimeable number, because it can be changed into a prime (125012650043) 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, 20011711 + ... + 20017956.
It is an arithmetic number, because the mean of its divisors is an integer number (15091184836).
Almost surely, 2125012650041 is an apocalyptic number.
It is an amenable number.
125012650041 is a deficient number, since it is larger than the sum of its proper divisors (56081567991).
125012650041 is a wasteful number, since it uses less digits than its factorization.
125012650041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40030020 (or 40030017 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 125012650041 its reverse (140056210521), we get a palindrome (265068860562).
The spelling of 125012650041 in words is "one hundred twenty-five billion, twelve million, six hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •