Base | Representation |
---|---|
bin | 11101011000101… |
… | …100000101100100 |
3 | 1021100200120100210 |
4 | 131120230011210 |
5 | 2002202330200 |
6 | 120530535420 |
7 | 15134345505 |
oct | 3530540544 |
9 | 1240616323 |
10 | 493011300 |
11 | 233323761 |
12 | 119137570 |
13 | 7b1a9082 |
14 | 49696bac |
15 | 2d437650 |
hex | 1d62c164 |
493011300 has 144 divisors (see below), whose sum is σ = 1472530752. Its totient is φ = 127296000.
The previous prime is 493011289. The next prime is 493011307. The reversal of 493011300 is 3110394.
It is not an unprimeable number, because it can be changed into a prime (493011307) 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 47 ways as a sum of consecutive naturals, for example, 1605747 + ... + 1606053.
It is an arithmetic number, because the mean of its divisors is an integer number (10225908).
Almost surely, 2493011300 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 493011300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (736265376).
493011300 is an abundant number, since it is smaller than the sum of its proper divisors (979519452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
493011300 is a wasteful number, since it uses less digits than its factorization.
493011300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478 (or 471 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
The square root of 493011300 is about 22203.8577729187. The cubic root of 493011300 is about 789.9852050853.
Adding to 493011300 its reverse (3110394), we get a palindrome (496121694).
The spelling of 493011300 in words is "four hundred ninety-three million, eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •