Base | Representation |
---|---|
bin | 111110101101001… |
… | …010011100010101 |
3 | 2201022120111020211 |
4 | 332231022130111 |
5 | 4123304323040 |
6 | 252220325421 |
7 | 35033036035 |
oct | 7655123425 |
9 | 2638514224 |
10 | 1052026645 |
11 | 49a92920a |
12 | 2543a3871 |
13 | 139c54b97 |
14 | 9da118c5 |
15 | 6255b8ea |
hex | 3eb4a715 |
1052026645 has 8 divisors (see below), whose sum is σ = 1264858200. Its totient is φ = 840003840.
The previous prime is 1052026639. The next prime is 1052026669. The reversal of 1052026645 is 5466202501.
It can be written as a sum of positive squares in 4 ways, for example, as 20268004 + 1031758641 = 4502^2 + 32121^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1052026645 - 29 = 1052026133 is a prime.
It is a super-5 number, since 5×10520266455 (a number of 46 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
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, 199320 + ... + 204529.
It is an arithmetic number, because the mean of its divisors is an integer number (158107275).
Almost surely, 21052026645 is an apocalyptic number.
It is an amenable number.
1052026645 is a deficient number, since it is larger than the sum of its proper divisors (212831555).
1052026645 is an equidigital number, since it uses as much as digits as its factorization.
1052026645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404375.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 1052026645 is about 32434.9602281242. The cubic root of 1052026645 is about 1017.0498649841.
The spelling of 1052026645 in words is "one billion, fifty-two million, twenty-six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •