Base | Representation |
---|---|
bin | 111101110000100… |
… | …110110110001101 |
3 | 2200012200222121121 |
4 | 331300212312031 |
5 | 4110223332310 |
6 | 250452200541 |
7 | 34451101624 |
oct | 7560466615 |
9 | 2605628547 |
10 | 1036152205 |
11 | 491976540 |
12 | 24b009151 |
13 | 13688751a |
14 | 9b87c6bb |
15 | 60e730da |
hex | 3dc26d8d |
1036152205 has 32 divisors (see below), whose sum is σ = 1397088000. Its totient is φ = 731174400.
The previous prime is 1036152199. The next prime is 1036152241. The reversal of 1036152205 is 5022516301.
It is not a de Polignac number, because 1036152205 - 215 = 1036119437 is a prime.
It is a super-3 number, since 3×10361522053 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1036152205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 447591 + ... + 449899.
It is an arithmetic number, because the mean of its divisors is an integer number (43659000).
Almost surely, 21036152205 is an apocalyptic number.
It is an amenable number.
1036152205 is a deficient number, since it is larger than the sum of its proper divisors (360935795).
1036152205 is a wasteful number, since it uses less digits than its factorization.
1036152205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2565.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 1036152205 is about 32189.3181816577. The cubic root of 1036152205 is about 1011.9083629862.
Adding to 1036152205 its reverse (5022516301), we get a palindrome (6058668506).
The spelling of 1036152205 in words is "one billion, thirty-six million, one hundred fifty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •