Base | Representation |
---|---|
bin | 100010010011100… |
… | …1011001101001101 |
3 | 2222020000222001200 |
4 | 1010213023031031 |
5 | 4324141321310 |
6 | 310120300113 |
7 | 40345234404 |
oct | 10447131515 |
9 | 2866028050 |
10 | 1151120205 |
11 | 540860714 |
12 | 281611639 |
13 | 15463bc21 |
14 | acc4863b |
15 | 6b0d29c0 |
hex | 449cb34d |
1151120205 has 12 divisors (see below), whose sum is σ = 1995275100. Its totient is φ = 613930752.
The previous prime is 1151120189. The next prime is 1151120207. The reversal of 1151120205 is 5020211511.
It can be written as a sum of positive squares in 2 ways, for example, as 269386569 + 881733636 = 16413^2 + 29694^2 .
It is not a de Polignac number, because 1151120205 - 24 = 1151120189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151120207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12790180 + ... + 12790269.
It is an arithmetic number, because the mean of its divisors is an integer number (166272925).
Almost surely, 21151120205 is an apocalyptic number.
1151120205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1151120205 is a deficient number, since it is larger than the sum of its proper divisors (844154895).
1151120205 is a wasteful number, since it uses less digits than its factorization.
1151120205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25580460 (or 25580457 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 1151120205 is about 33928.1624170835. The cubic root of 1151120205 is about 1048.0296245365.
Adding to 1151120205 its reverse (5020211511), we get a palindrome (6171331716).
The spelling of 1151120205 in words is "one billion, one hundred fifty-one million, one hundred twenty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •