Base | Representation |
---|---|
bin | 110010111011100… |
… | …010100000100001 |
3 | 2012112211111121201 |
4 | 302323202200201 |
5 | 3222220444031 |
6 | 220442121201 |
7 | 30113602135 |
oct | 6273424041 |
9 | 2175744551 |
10 | 854468641 |
11 | 3a9363a34 |
12 | 1ba1b0201 |
13 | 108044260 |
14 | 816a73c5 |
15 | 50035d61 |
hex | 32ee2821 |
854468641 has 4 divisors (see below), whose sum is σ = 920197012. Its totient is φ = 788740272.
The previous prime is 854468581. The next prime is 854468651. The reversal of 854468641 is 146864458.
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 194184225 + 660284416 = 13935^2 + 25696^2 .
It is a cyclic number.
It is not a de Polignac number, because 854468641 - 29 = 854468129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 854468591 and 854468600.
It is not an unprimeable number, because it can be changed into a prime (854468651) 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, 32864166 + ... + 32864191.
It is an arithmetic number, because the mean of its divisors is an integer number (230049253).
Almost surely, 2854468641 is an apocalyptic number.
It is an amenable number.
854468641 is a deficient number, since it is larger than the sum of its proper divisors (65728371).
854468641 is a wasteful number, since it uses less digits than its factorization.
854468641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65728370.
The product of its digits is 737280, while the sum is 46.
The square root of 854468641 is about 29231.2955751195. The cubic root of 854468641 is about 948.9253373136.
The spelling of 854468641 in words is "eight hundred fifty-four million, four hundred sixty-eight thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •