Base | Representation |
---|---|
bin | 110010110010001… |
… | …011001010111001 |
3 | 2012101012210010221 |
4 | 302302023022321 |
5 | 3221103420003 |
6 | 220313340041 |
7 | 30053666053 |
oct | 6262131271 |
9 | 2171183127 |
10 | 852013753 |
11 | 3a7a375a8 |
12 | 1b9407621 |
13 | 107694a66 |
14 | 812288d3 |
15 | 4ebed7bd |
hex | 32c8b2b9 |
852013753 has 4 divisors (see below), whose sum is σ = 853006480. Its totient is φ = 851021028.
The previous prime is 852013693. The next prime is 852013781. The reversal of 852013753 is 357310258.
852013753 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-852013753 is a prime.
It is a super-2 number, since 2×8520137532 = 1451854870602290018, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (852013153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 495075 + ... + 496792.
It is an arithmetic number, because the mean of its divisors is an integer number (213251620).
Almost surely, 2852013753 is an apocalyptic number.
It is an amenable number.
852013753 is a deficient number, since it is larger than the sum of its proper divisors (992727).
852013753 is an equidigital number, since it uses as much as digits as its factorization.
852013753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992726.
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 852013753 is about 29189.2746227103. The cubic root of 852013753 is about 948.0157116240.
The spelling of 852013753 in words is "eight hundred fifty-two million, thirteen thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •