Base | Representation |
---|---|
bin | 11101011010010… |
… | …111010100101110 |
3 | 1021101111212220000 |
4 | 131122113110232 |
5 | 2002310404132 |
6 | 120544205130 |
7 | 15141155214 |
oct | 3532272456 |
9 | 1241455800 |
10 | 493450542 |
11 | 2335a3772 |
12 | 1193097a6 |
13 | 7b300c90 |
14 | 4976ccb4 |
15 | 2d4c287c |
hex | 1d69752e |
493450542 has 80 divisors (see below), whose sum is σ = 1218663600. Its totient is φ = 148272768.
The previous prime is 493450513. The next prime is 493450561. The reversal of 493450542 is 245054394.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 493450497 and 493450506.
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 39 ways as a sum of consecutive naturals, for example, 87834 + ... + 93282.
It is an arithmetic number, because the mean of its divisors is an integer number (15233295).
Almost surely, 2493450542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 493450542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (609331800).
493450542 is an abundant number, since it is smaller than the sum of its proper divisors (725213058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
493450542 is a wasteful number, since it uses less digits than its factorization.
493450542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5519 (or 5510 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 493450542 is about 22213.7466898315. The cubic root of 493450542 is about 790.2197444575.
The spelling of 493450542 in words is "four hundred ninety-three million, four hundred fifty thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •