Base | Representation |
---|---|
bin | 100010000000100… |
… | …0000000100100101 |
3 | 2221112012112221002 |
4 | 1010001000010211 |
5 | 4314111110000 |
6 | 305122003045 |
7 | 40164205265 |
oct | 10401000445 |
9 | 2845175832 |
10 | 1141113125 |
11 | 5361461a9 |
12 | 27a1a6485 |
13 | 152547089 |
14 | ab7a17a5 |
15 | 6a2a78d5 |
hex | 44040125 |
1141113125 has 10 divisors (see below), whose sum is σ = 1425935742. Its totient is φ = 912890000.
The previous prime is 1141113121. The next prime is 1141113137. The reversal of 1141113125 is 5213111411.
It can be written as a sum of positive squares in 5 ways, for example, as 210192004 + 930921121 = 14498^2 + 30511^2 .
It is not a de Polignac number, because 1141113125 - 22 = 1141113121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1141113097 and 1141113106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141113121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 912266 + ... + 913515.
Almost surely, 21141113125 is an apocalyptic number.
It is an amenable number.
1141113125 is a deficient number, since it is larger than the sum of its proper divisors (284822617).
1141113125 is an frugal number, since it uses more digits than its factorization.
1141113125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1825801 (or 1825786 counting only the distinct ones).
The product of its digits is 120, while the sum is 20.
The square root of 1141113125 is about 33780.3659690063. The cubic root of 1141113125 is about 1044.9838218537.
Adding to 1141113125 its reverse (5213111411), we get a palindrome (6354224536).
The spelling of 1141113125 in words is "one billion, one hundred forty-one million, one hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •