Base | Representation |
---|---|
bin | 1001001110011010… |
… | …00110100001010101 |
3 | 110210011101220101222 |
4 | 10213031012201111 |
5 | 40120343311201 |
6 | 2135241500125 |
7 | 233506240244 |
oct | 44715064125 |
9 | 13704356358 |
10 | 4952713301 |
11 | 211174a898 |
12 | b627a1645 |
13 | 60c1134b3 |
14 | 34dab295b |
15 | 1dec1591b |
hex | 127346855 |
4952713301 has 4 divisors (see below), whose sum is σ = 4974341100. Its totient is φ = 4931085504.
The previous prime is 4952713291. The next prime is 4952713307. The reversal of 4952713301 is 1033172594.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4757412676 + 195300625 = 68974^2 + 13975^2 .
It is a cyclic number.
It is not a de Polignac number, because 4952713301 - 26 = 4952713237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4952713307) 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, 10813556 + ... + 10814013.
It is an arithmetic number, because the mean of its divisors is an integer number (1243585275).
Almost surely, 24952713301 is an apocalyptic number.
It is an amenable number.
4952713301 is a deficient number, since it is larger than the sum of its proper divisors (21627799).
4952713301 is a wasteful number, since it uses less digits than its factorization.
4952713301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21627798.
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 4952713301 is about 70375.5163462408. The cubic root of 4952713301 is about 1704.5682553615.
Adding to 4952713301 its reverse (1033172594), we get a palindrome (5985885895).
The spelling of 4952713301 in words is "four billion, nine hundred fifty-two million, seven hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •