Base | Representation |
---|---|
bin | 1010101110100010… |
… | …00001011001010101 |
3 | 112212100122220122102 |
4 | 11113101001121111 |
5 | 43243304003003 |
6 | 2351244211445 |
7 | 262500044141 |
oct | 52721013125 |
9 | 15770586572 |
10 | 5759047253 |
11 | 2495917493 |
12 | 1148839b85 |
13 | 70a1a338b |
14 | 3c8c0a221 |
15 | 23a8de588 |
hex | 157441655 |
5759047253 has 4 divisors (see below), whose sum is σ = 5783764428. Its totient is φ = 5734330080.
The previous prime is 5759047223. The next prime is 5759047267. The reversal of 5759047253 is 3527409575.
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 2970468004 + 2788579249 = 54502^2 + 52807^2 .
It is a cyclic number.
It is not a de Polignac number, because 5759047253 - 214 = 5759030869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5759047198 and 5759047207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5759047223) 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, 12358238 + ... + 12358703.
It is an arithmetic number, because the mean of its divisors is an integer number (1445941107).
Almost surely, 25759047253 is an apocalyptic number.
It is an amenable number.
5759047253 is a deficient number, since it is larger than the sum of its proper divisors (24717175).
5759047253 is a wasteful number, since it uses less digits than its factorization.
5759047253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24717174.
The product of its (nonzero) digits is 1323000, while the sum is 47.
The square root of 5759047253 is about 75888.3868124761. The cubic root of 5759047253 is about 1792.4630587997.
The spelling of 5759047253 in words is "five billion, seven hundred fifty-nine million, forty-seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •