Base | Representation |
---|---|
bin | 111110101101001… |
… | …011010100000111 |
3 | 2201022120200011001 |
4 | 332231023110013 |
5 | 4123304431330 |
6 | 252220354131 |
7 | 35033052325 |
oct | 7655132407 |
9 | 2638520131 |
10 | 1052030215 |
11 | 49a930965 |
12 | 2543a5947 |
13 | 139c566b2 |
14 | 9da12d15 |
15 | 6255c9ca |
hex | 3eb4b507 |
1052030215 has 8 divisors (see below), whose sum is σ = 1272073968. Its totient is φ = 835199040.
The previous prime is 1052030197. The next prime is 1052030249. The reversal of 1052030215 is 5120302501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1052030215 - 215 = 1051997447 is a prime.
It is a super-2 number, since 2×10520302152 = 2213535146545892450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1052030192 and 1052030201.
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 7 ways as a sum of consecutive naturals, for example, 802422 + ... + 803731.
It is an arithmetic number, because the mean of its divisors is an integer number (159009246).
Almost surely, 21052030215 is an apocalyptic number.
1052030215 is a deficient number, since it is larger than the sum of its proper divisors (220043753).
1052030215 is a wasteful number, since it uses less digits than its factorization.
1052030215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1606289.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 1052030215 is about 32435.0152612882. The cubic root of 1052030215 is about 1017.0510154188.
Adding to 1052030215 its reverse (5120302501), we get a palindrome (6172332716).
The spelling of 1052030215 in words is "one billion, fifty-two million, thirty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •