Base | Representation |
---|---|
bin | 100001011000011… |
… | …1111111011110101 |
3 | 2220001202001122101 |
4 | 1002300333323311 |
5 | 4243224003140 |
6 | 303052302101 |
7 | 36521020222 |
oct | 10260777365 |
9 | 2801661571 |
10 | 1120141045 |
11 | 525321601 |
12 | 273171931 |
13 | 14b0b336a |
14 | a8aa2949 |
15 | 6851399a |
hex | 42c3fef5 |
1120141045 has 8 divisors (see below), whose sum is σ = 1354430880. Its totient is φ = 889271760.
The previous prime is 1120141039. The next prime is 1120141049. The reversal of 1120141045 is 5401410211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1120141045 is a prime.
It is a super-3 number, since 3×11201410453 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120141049) 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 7 ways as a sum of consecutive naturals, for example, 854415 + ... + 855724.
It is an arithmetic number, because the mean of its divisors is an integer number (169303860).
Almost surely, 21120141045 is an apocalyptic number.
It is an amenable number.
1120141045 is a deficient number, since it is larger than the sum of its proper divisors (234289835).
1120141045 is a wasteful number, since it uses less digits than its factorization.
1120141045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1710275.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 1120141045 is about 33468.5082577637. The cubic root of 1120141045 is about 1038.5424123101.
Adding to 1120141045 its reverse (5401410211), we get a palindrome (6521551256).
The spelling of 1120141045 in words is "one billion, one hundred twenty million, one hundred forty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •