Base | Representation |
---|---|
bin | 1110011000100001010… |
… | …10010011001001011100 |
3 | 1202020121200220221120221 |
4 | 13030100222103021130 |
5 | 31044110343403342 |
6 | 1015011021251124 |
7 | 50463520113640 |
oct | 7142052231134 |
9 | 1666550827527 |
10 | 494200762972 |
11 | 1806534a0924 |
12 | 7b942a03aa4 |
13 | 377ab845687 |
14 | 19cc2d54c20 |
15 | ccc6955a67 |
hex | 7310a9325c |
494200762972 has 96 divisors (see below), whose sum is σ = 1065130577280. Its totient is φ = 195809771520.
The previous prime is 494200762969. The next prime is 494200762973. The reversal of 494200762972 is 279267002494.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (494200762973) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 22317618 + ... + 22339750.
It is an arithmetic number, because the mean of its divisors is an integer number (11095110180).
Almost surely, 2494200762972 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 494200762972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (532565288640).
494200762972 is an abundant number, since it is smaller than the sum of its proper divisors (570929814308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
494200762972 is a wasteful number, since it uses less digits than its factorization.
494200762972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22991 (or 22989 counting only the distinct ones).
The product of its (nonzero) digits is 3048192, while the sum is 52.
The spelling of 494200762972 in words is "four hundred ninety-four billion, two hundred million, seven hundred sixty-two thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •