Base | Representation |
---|---|
bin | 1001001110010101… |
… | …10001010001111101 |
3 | 110210010020211212200 |
4 | 10213022301101331 |
5 | 40120214231023 |
6 | 2135220422113 |
7 | 233501113125 |
oct | 44712612175 |
9 | 13703224780 |
10 | 4952102013 |
11 | 21113725a1 |
12 | b62547939 |
13 | 60bc5b1a1 |
14 | 34d993c85 |
15 | 1deb44743 |
hex | 1272b147d |
4952102013 has 12 divisors (see below), whose sum is σ = 7223859708. Its totient is φ = 3268713600.
The previous prime is 4952101997. The next prime is 4952102017. The reversal of 4952102013 is 3102012594.
It can be written as a sum of positive squares in 2 ways, for example, as 4469992164 + 482109849 = 66858^2 + 21957^2 .
It is not a de Polignac number, because 4952102013 - 24 = 4952101997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4952102017) 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, 2723020 + ... + 2724837.
It is an arithmetic number, because the mean of its divisors is an integer number (601988309).
Almost surely, 24952102013 is an apocalyptic number.
It is an amenable number.
4952102013 is a deficient number, since it is larger than the sum of its proper divisors (2271757695).
4952102013 is a wasteful number, since it uses less digits than its factorization.
4952102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5447964 (or 5447961 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 4952102013 is about 70371.1731677112. The cubic root of 4952102013 is about 1704.4981237705.
The spelling of 4952102013 in words is "four billion, nine hundred fifty-two million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •