Base | Representation |
---|---|
bin | 111110110000001… |
… | …010010011010101 |
3 | 2201101001102020121 |
4 | 332300022103111 |
5 | 4124010000001 |
6 | 252245231541 |
7 | 35042521126 |
oct | 7660122325 |
9 | 2641042217 |
10 | 1052812501 |
11 | 4a0315684 |
12 | 2547025b1 |
13 | 13a16b7a0 |
14 | 9db7804d |
15 | 626646a1 |
hex | 3ec0a4d5 |
1052812501 has 8 divisors (see below), whose sum is σ = 1136509920. Its totient is φ = 969502512.
The previous prime is 1052812493. The next prime is 1052812517. The reversal of 1052812501 is 1052182501.
1052812501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052812501 - 23 = 1052812493 is a prime.
It is a super-3 number, since 3×10528125013 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052812571) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91195 + ... + 102088.
It is an arithmetic number, because the mean of its divisors is an integer number (142063740).
Almost surely, 21052812501 is an apocalyptic number.
It is an amenable number.
1052812501 is a deficient number, since it is larger than the sum of its proper divisors (83697419).
1052812501 is a wasteful number, since it uses less digits than its factorization.
1052812501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193715.
The product of its (nonzero) digits is 800, while the sum is 25.
The square root of 1052812501 is about 32447.0723024436. The cubic root of 1052812501 is about 1017.3030448227.
The spelling of 1052812501 in words is "one billion, fifty-two million, eight hundred twelve thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •