Base | Representation |
---|---|
bin | 1000101010101011… |
… | …00010001101111101 |
3 | 110000021022112112101 |
4 | 10111111202031331 |
5 | 34012122342023 |
6 | 2045412305101 |
7 | 223206200200 |
oct | 42525421575 |
9 | 13007275471 |
10 | 4652934013 |
11 | 1a78507212 |
12 | a9a312191 |
13 | 591c91cc0 |
14 | 321d59937 |
15 | 1c374c1ad |
hex | 11556237d |
4652934013 has 12 divisors (see below), whose sum is σ = 5828951100. Its totient is φ = 3681441792.
The previous prime is 4652934007. The next prime is 4652934023. The reversal of 4652934013 is 3104392564.
It can be written as a sum of positive squares in 2 ways, for example, as 600593049 + 4052340964 = 24507^2 + 63658^2 .
It is a de Polignac number, because none of the positive numbers 2k-4652934013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4652934023) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 3651588 + ... + 3652861.
It is an arithmetic number, because the mean of its divisors is an integer number (485745925).
Almost surely, 24652934013 is an apocalyptic number.
It is an amenable number.
4652934013 is a deficient number, since it is larger than the sum of its proper divisors (1176017087).
4652934013 is a wasteful number, since it uses less digits than its factorization.
4652934013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7304476 (or 7304469 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 37.
The square root of 4652934013 is about 68212.4183195406. The cubic root of 4652934013 is about 1669.4585134149.
The spelling of 4652934013 in words is "four billion, six hundred fifty-two million, nine hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •