Base | Representation |
---|---|
bin | 11101011110101… |
… | …110011001110000 |
3 | 1021110122221221021 |
4 | 131132232121300 |
5 | 2003103444043 |
6 | 121024505224 |
7 | 15153655663 |
oct | 3536563160 |
9 | 1243587837 |
10 | 494593648 |
11 | 23420458a |
12 | 11977b214 |
13 | 7b611383 |
14 | 499896da |
15 | 2d64b3ed |
hex | 1d7ae670 |
494593648 has 40 divisors (see below), whose sum is σ = 1026095040. Its totient is φ = 230123520.
The previous prime is 494593609. The next prime is 494593651. The reversal of 494593648 is 846395494.
It is a junction number, because it is equal to n+sod(n) for n = 494593595 and 494593604.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13993 + ... + 34423.
It is an arithmetic number, because the mean of its divisors is an integer number (25652376).
Almost surely, 2494593648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 494593648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (513047520).
494593648 is an abundant number, since it is smaller than the sum of its proper divisors (531501392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
494593648 is a wasteful number, since it uses less digits than its factorization.
494593648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20545 (or 20539 counting only the distinct ones).
The product of its digits is 3732480, while the sum is 52.
The square root of 494593648 is about 22239.4615042721. The cubic root of 494593648 is about 790.8294700745.
The spelling of 494593648 in words is "four hundred ninety-four million, five hundred ninety-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •