Base | Representation |
---|---|
bin | 1110010111011001111… |
… | …10000010011011000000 |
3 | 1202012001222011111000000 |
4 | 13023230332002123000 |
5 | 31041344100120233 |
6 | 1014431351000000 |
7 | 50442626261406 |
oct | 7135476023300 |
9 | 1665058144000 |
10 | 493601957568 |
11 | 180376489525 |
12 | 7b7b6369000 |
13 | 37714777755 |
14 | 19c675dd476 |
15 | cc8e0c1d13 |
hex | 72ecf826c0 |
493601957568 has 196 divisors, whose sum is σ = 1472212808680. Its totient is φ = 164125357056.
The previous prime is 493601957533. The next prime is 493601957591. The reversal of 493601957568 is 865759106394.
493601957568 is a `hidden beast` number, since 4 + 9 + 3 + 6 + 0 + 19 + 57 + 568 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 19069371 + ... + 19095237.
Almost surely, 2493601957568 is an apocalyptic number.
493601957568 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 493601957568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (736106404340).
493601957568 is an abundant number, since it is smaller than the sum of its proper divisors (978610851112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
493601957568 is an equidigital number, since it uses as much as digits as its factorization.
493601957568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26306 (or 26281 counting only the distinct ones).
The product of its (nonzero) digits is 48988800, while the sum is 63.
The spelling of 493601957568 in words is "four hundred ninety-three billion, six hundred one million, nine hundred fifty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •