Base | Representation |
---|---|
bin | 1000110110100100… |
… | …11000110111011111 |
3 | 110021020011212021220 |
4 | 10123102120313133 |
5 | 34213202210300 |
6 | 2103340224423 |
7 | 225530620545 |
oct | 43322306737 |
9 | 13236155256 |
10 | 4752772575 |
11 | 20198a8421 |
12 | b0783b113 |
13 | 5a987a185 |
14 | 331307d95 |
15 | 1cc3bdda0 |
hex | 11b498ddf |
4752772575 has 48 divisors (see below), whose sum is σ = 8295302400. Its totient is φ = 2401140960.
The previous prime is 4752772573. The next prime is 4752772579. The reversal of 4752772575 is 5752772574.
4752772575 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4752772575 - 21 = 4752772573 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4752772573) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 509806 + ... + 519044.
It is an arithmetic number, because the mean of its divisors is an integer number (172818800).
Almost surely, 24752772575 is an apocalyptic number.
4752772575 is a deficient number, since it is larger than the sum of its proper divisors (3542529825).
4752772575 is an equidigital number, since it uses as much as digits as its factorization.
4752772575 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9309 (or 9266 counting only the distinct ones).
The product of its digits is 4802000, while the sum is 51.
The square root of 4752772575 is about 68940.3551992590. The cubic root of 4752772575 is about 1681.3147039585.
Subtracting 4752772575 from its reverse (5752772574), we obtain a palindrome (999999999).
The spelling of 4752772575 in words is "four billion, seven hundred fifty-two million, seven hundred seventy-two thousand, five hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •