Base | Representation |
---|---|
bin | 1001001000101101… |
… | …00110000010101001 |
3 | 110122211101012210222 |
4 | 10210112212002221 |
5 | 40021121320212 |
6 | 2130412215425 |
7 | 232355464463 |
oct | 44426460251 |
9 | 13584335728 |
10 | 4904870057 |
11 | 209774251a |
12 | b4a76a575 |
13 | 602231999 |
14 | 3475bb133 |
15 | 1da914c72 |
hex | 1245a60a9 |
4904870057 has 4 divisors (see below), whose sum is σ = 5024501076. Its totient is φ = 4785239040.
The previous prime is 4904870053. The next prime is 4904870063. The reversal of 4904870057 is 7500784094.
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 2026440256 + 2878429801 = 45016^2 + 53651^2 .
It is a cyclic number.
It is not a de Polignac number, because 4904870057 - 22 = 4904870053 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4904870051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59815448 + ... + 59815529.
It is an arithmetic number, because the mean of its divisors is an integer number (1256125269).
Almost surely, 24904870057 is an apocalyptic number.
It is an amenable number.
4904870057 is a deficient number, since it is larger than the sum of its proper divisors (119631019).
4904870057 is a wasteful number, since it uses less digits than its factorization.
4904870057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119631018.
The product of its (nonzero) digits is 282240, while the sum is 44.
The square root of 4904870057 is about 70034.7774823337. Note that the first 3 decimals coincide. The cubic root of 4904870057 is about 1699.0617726004.
The spelling of 4904870057 in words is "four billion, nine hundred four million, eight hundred seventy thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •