Base | Representation |
---|---|
bin | 100001011010010… |
… | …1101010010011101 |
3 | 2220010120110020210 |
4 | 1002310231102131 |
5 | 4244001110440 |
6 | 303125203033 |
7 | 36532206510 |
oct | 10264552235 |
9 | 2803513223 |
10 | 1121113245 |
11 | 525925a7a |
12 | 273560479 |
13 | 14b363a25 |
14 | a8c76d77 |
15 | 68656a80 |
hex | 42d2d49d |
1121113245 has 16 divisors (see below), whose sum is σ = 2050035840. Its totient is φ = 512508864.
The previous prime is 1121113237. The next prime is 1121113247. The reversal of 1121113245 is 5423111211.
It is not a de Polignac number, because 1121113245 - 23 = 1121113237 is a prime.
It is a super-2 number, since 2×11211132452 = 2513789816228860050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121113247) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5338530 + ... + 5338739.
It is an arithmetic number, because the mean of its divisors is an integer number (128127240).
Almost surely, 21121113245 is an apocalyptic number.
1121113245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1121113245 is a deficient number, since it is larger than the sum of its proper divisors (928922595).
1121113245 is a wasteful number, since it uses less digits than its factorization.
1121113245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10677284.
The product of its digits is 240, while the sum is 21.
The square root of 1121113245 is about 33483.0292088395. The cubic root of 1121113245 is about 1038.8427848902.
Adding to 1121113245 its reverse (5423111211), we get a palindrome (6544224456).
The spelling of 1121113245 in words is "one billion, one hundred twenty-one million, one hundred thirteen thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •