Base | Representation |
---|---|
bin | 1110011000110101101… |
… | …01011100000000000000 |
3 | 1202021001121010000000000 |
4 | 13030122311130000000 |
5 | 31044433043024401 |
6 | 1015040000000000 |
7 | 50500662014160 |
oct | 7143265340000 |
9 | 1667047100000 |
10 | 494371454976 |
11 | 1807308862a3 |
12 | 7b990000000 |
13 | 3780800a969 |
14 | 19cdb8a85a0 |
15 | ccd6921186 |
hex | 731ad5c000 |
494371454976 has 660 divisors, whose sum is σ = 1718144722672. Its totient is φ = 139314069504.
The previous prime is 494371454963. The next prime is 494371454989. The reversal of 494371454976 is 679454173494.
494371454976 is a `hidden beast` number, since 4 + 9 + 4 + 3 + 7 + 14 + 549 + 76 = 666.
It is an interprime number because it is at equal distance from previous prime (494371454963) and next prime (494371454989).
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 43 ways as a sum of consecutive naturals, for example, 6772211676 + ... + 6772211748.
Almost surely, 2494371454976 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 494371454976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (859072361336).
494371454976 is an abundant number, since it is smaller than the sum of its proper divisors (1223773267696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
494371454976 is an frugal number, since it uses more digits than its factorization.
494371454976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138 (or 85 counting only the distinct ones).
The product of its digits is 91445760, while the sum is 63.
The spelling of 494371454976 in words is "four hundred ninety-four billion, three hundred seventy-one million, four hundred fifty-four thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •