Base | Representation |
---|---|
bin | 111110101111001… |
… | …000010011111101 |
3 | 2201100112200110122 |
4 | 332233020103331 |
5 | 4123422322310 |
6 | 252235344325 |
7 | 35040314111 |
oct | 7657102375 |
9 | 2640480418 |
10 | 1052542205 |
11 | 4a01505a0 |
12 | 2545b20a5 |
13 | 13a0a5750 |
14 | 9db07741 |
15 | 6260e555 |
hex | 3ebc84fd |
1052542205 has 32 divisors (see below), whose sum is σ = 1515483648. Its totient is φ = 691545600.
The previous prime is 1052542187. The next prime is 1052542223. The reversal of 1052542205 is 5022452501.
It is an interprime number because it is at equal distance from previous prime (1052542187) and next prime (1052542223).
It is not a de Polignac number, because 1052542205 - 210 = 1052541181 is a prime.
It is a super-2 number, since 2×10525422052 = 2215690186612524050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 17945 + ... + 49265.
It is an arithmetic number, because the mean of its divisors is an integer number (47358864).
Almost surely, 21052542205 is an apocalyptic number.
It is an amenable number.
1052542205 is a deficient number, since it is larger than the sum of its proper divisors (462941443).
1052542205 is a wasteful number, since it uses less digits than its factorization.
1052542205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31397.
The product of its (nonzero) digits is 4000, while the sum is 26.
The square root of 1052542205 is about 32442.9068518837. The cubic root of 1052542205 is about 1017.2159775691.
Adding to 1052542205 its reverse (5022452501), we get a palindrome (6074994706).
The spelling of 1052542205 in words is "one billion, fifty-two million, five hundred forty-two thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •