Base | Representation |
---|---|
bin | 1000100100111111… |
… | …00111111001001101 |
3 | 102212221120210022200 |
4 | 10102133213321031 |
5 | 33412420401203 |
6 | 2040550232113 |
7 | 222056645151 |
oct | 42237477115 |
9 | 12787523280 |
10 | 4605247053 |
11 | 1a535a6300 |
12 | a86355639 |
13 | 585136674 |
14 | 3198a5061 |
15 | 1be47c9a3 |
hex | 1127e7e4d |
4605247053 has 36 divisors (see below), whose sum is σ = 7322653884. Its totient is φ = 2786889600.
The previous prime is 4605247051. The next prime is 4605247091. The reversal of 4605247053 is 3507425064.
4605247053 is a `hidden beast` number, since 4 + 60 + 524 + 70 + 5 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1865980809 + 2739266244 = 43197^2 + 52338^2 .
It is not a de Polignac number, because 4605247053 - 21 = 4605247051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4605246999 and 4605247017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4605247051) 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 35 ways as a sum of consecutive naturals, for example, 825951 + ... + 831507.
Almost surely, 24605247053 is an apocalyptic number.
It is an amenable number.
4605247053 is a deficient number, since it is larger than the sum of its proper divisors (2717406831).
4605247053 is a wasteful number, since it uses less digits than its factorization.
4605247053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6346 (or 6332 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 36.
The square root of 4605247053 is about 67861.9705947300. The cubic root of 4605247053 is about 1663.7356058222.
The spelling of 4605247053 in words is "four billion, six hundred five million, two hundred forty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •