Base | Representation |
---|---|
bin | 1001000010011000… |
… | …00111000001110101 |
3 | 110112010111110120202 |
4 | 10201030013001311 |
5 | 34414024234231 |
6 | 2121234410245 |
7 | 231142351115 |
oct | 44114070165 |
9 | 13463443522 |
10 | 4851789941 |
11 | 206a788659 |
12 | b34a30985 |
13 | 5c423862b |
14 | 340521045 |
15 | 1d5e2c5cb |
hex | 121307075 |
4851789941 has 8 divisors (see below), whose sum is σ = 4908869784. Its totient is φ = 4794854400.
The previous prime is 4851789937. The next prime is 4851789959. The reversal of 4851789941 is 1499871584.
It can be written as a sum of positive squares in 4 ways, for example, as 3129954916 + 1721835025 = 55946^2 + 41495^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4851789941 - 22 = 4851789937 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4851789991) 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 7 ways as a sum of consecutive naturals, for example, 32321 + ... + 103673.
It is an arithmetic number, because the mean of its divisors is an integer number (613608723).
Almost surely, 24851789941 is an apocalyptic number.
It is an amenable number.
4851789941 is a deficient number, since it is larger than the sum of its proper divisors (57079843).
4851789941 is an equidigital number, since it uses as much as digits as its factorization.
4851789941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72151.
The product of its digits is 2903040, while the sum is 56.
The square root of 4851789941 is about 69654.7912278832. The cubic root of 4851789941 is about 1692.9104919949.
The spelling of 4851789941 in words is "four billion, eight hundred fifty-one million, seven hundred eighty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •