Base | Representation |
---|---|
bin | 1001000010010001… |
… | …00011010011111101 |
3 | 110112001202002010021 |
4 | 10201020203103331 |
5 | 34413304412323 |
6 | 2121202412141 |
7 | 231131414566 |
oct | 44110432375 |
9 | 13461662107 |
10 | 4850857213 |
11 | 206a200904 |
12 | b34661051 |
13 | 5c3c9cc17 |
14 | 34035b16d |
15 | 1d5ce605d |
hex | 1212234fd |
4850857213 has 4 divisors (see below), whose sum is σ = 4981961500. Its totient is φ = 4719752928.
The previous prime is 4850857211. The next prime is 4850857223. The reversal of 4850857213 is 3127580584.
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 3429039364 + 1421817849 = 58558^2 + 37707^2 .
It is a cyclic number.
It is not a de Polignac number, because 4850857213 - 21 = 4850857211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4850857213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4850857211) 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, 65552088 + ... + 65552161.
It is an arithmetic number, because the mean of its divisors is an integer number (1245490375).
Almost surely, 24850857213 is an apocalyptic number.
It is an amenable number.
4850857213 is a deficient number, since it is larger than the sum of its proper divisors (131104287).
4850857213 is a wasteful number, since it uses less digits than its factorization.
4850857213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131104286.
The product of its (nonzero) digits is 268800, while the sum is 43.
The square root of 4850857213 is about 69648.0955446737. The cubic root of 4850857213 is about 1692.8020010233.
The spelling of 4850857213 in words is "four billion, eight hundred fifty million, eight hundred fifty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •